The word ′PROGRAMMER′ has 10 letters where R occurs 3 times , M occurs 2 times .Therefore, required number of ways =10!3!× 2! =302400the number of distinct permutation of the word ′programmer ′ =302400The \space word \space 'PROGRAMMER' \space has \space 10 \space letters \space where \space R \space occurs \space 3 \space times \space , \\ \space M \space occurs \space 2 \space times \space .\\ Therefore, \space required \space number \space of \space ways \space \\ =\frac{10!}{3!× \space 2! \space }\\ =302400\\ the \space number \space of \space distinct \space permutation \space of \space the \space word \space 'programmer \space ' \space =302400\\The word ′PROGRAMMER′ has 10 letters where R occurs 3 times , M occurs 2 times .Therefore, required number of ways =3!× 2! 10!=302400the number of distinct permutation of the word ′programmer ′ =302400
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments