1.

In How Many Ways Can The Letters Of The Word "problem" Be Rearranged To Make 7 Letter Words Such That None Of The Letters Repeat?

Answer»

There are seven positions to be filled.

The first position can be filled using any of the 7 LETTERS CONTAINED in PROBLEM.

The SECOND position can be filled by the remaining 6 letters as the letters should not repeat.

The third position can be filled by the remaining 5 letters only and so on.

Therefore, the total NUMBER of ways of rearranging the 7 letter word = 7*6*5*4*3*2*1 = 7! ways.

There are seven positions to be filled.

The first position can be filled using any of the 7 letters contained in PROBLEM.

The second position can be filled by the remaining 6 letters as the letters should not repeat.

The third position can be filled by the remaining 5 letters only and so on.

Therefore, the total number of ways of rearranging the 7 letter word = 7*6*5*4*3*2*1 = 7! ways.



Discussion

No Comment Found

Related InterviewSolutions