Permutations – Fundamental Counting Principle, Factorial, nPr

Grade 11 Maths Higher — Permutations – Fundamental Counting Principle, Factorial, nPr: 25 practice questions with instant scoring and explanations.

1. The Fundamental Counting Principle states that if one task can be done in m ways and another in n ways, both can be done in:
2. 0! (zero factorial) equals:
3. 5! =
4. nPr is defined as:
5. 5P3 =
6. 8P2 =
7. The number of permutations of 4 objects taken 4 at a time is:
8. nPn =
9. nP1 =
10. 10P1 + 10P2 + 10P3 is equal to:
11. How many 2-digit numbers can be formed using digits 1, 2, 3, 4, 5 without repetition?
12. A committee of 3 people is to be selected and arranged in a line from 7 people. The number of ways is:
13. 6P4 =
14. The number of 3-letter words that can be formed from letters A, B, C, D, E (with repetition) is:
15. How many different 4-digit numbers can be formed using 2, 3, 5, 7, 9 without repetition?
16. nP0 =
17. In how many ways can 5 books be arranged on a shelf?
18. 9P2 =
19. How many ways can 6 people sit around a table? (considering circular arrangements as different)
20. The relation between nPr and nCr is:
21. 7P3 =
22. How many 3-digit even numbers can be formed using 1, 2, 3, 4, 5 without repetition?
23. If nP2 = 30, then n =
24. The number of ways to arrange the letters of WORD is:
25. How many permutations of the letters A, B, C, D start with A?