In how many ways can the letters of the word "PROBLEC" be rearranged to make 7 letter words such that none of the letters repeat?
Correct answer: C
Explanation
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.
758
Therefore, the total number of ways of rearranging the 7 letter word = 7*6*5*4*3*2*1 = 7! Ways.
C
Loading…
Searched on YouTube by reporting category, not by question text. Open this search on YouTube →
AQuA-RAT items are crowdsourced algebra problems, not ACT questions. They carry five answer choices in the pre-2025 ACT Mathematics style and no ACT reporting category. Useful for drilling Preparing for Higher Math content; not a substitute for a real form.