- Foundation
- About 14 min
- 5 practice questions
Repetition allowed: the nʳ rule and which number is the base
Count codes, answer sheets and assignments when the same choice may be used again, using nʳ, and decide whether a problem is nʳ or rⁿ by asking who is making the choices.
If something looks wrong, please tell us.
When objects cannot be reused, we count with ⁿPᵣ. Many everyday situations allow reuse: a PIN may repeat digits, a True/False test may have the same answer many times. For these the count is much simpler, a single power. The only difficulty is deciding which number is the base and which is the exponent.
The rule
If there are r positions to fill and each can be filled in n ways, independently of the others, the number of ways is n × n × … × n (r times), which is nʳ. This is the multiplication principle with the same number of choices at every step, because nothing is used up.
Each position (or each person) makes one choice from n options, and repeats are allowed: the count is nʳ, where n is the number of options and r the number of choosers.
Worked example 1: PINs and codes
A PIN has 4 digits chosen from 0 to 9. With repeats allowed, each of the 4 places has 10 choices, so there are 10⁴ = 10 000 PINs. If no digit may repeat, the choices shrink: 10 × 9 × 8 × 7 = 5 040. The difference, 10 000 − 5 040 = 4 960, is the number of PINs with at least one repeated digit. A code of 3 letters from the 26 letters, with repeats allowed, has 26³ = 17 576 possibilities.
Worked example 2: a True/False test
A test has 5 True/False questions, and each is answered True or False. Each question (a chooser) has 2 options, so there are 2⁵ = 32 possible answer sheets. Exactly one of them is entirely correct. Out of the 32 sheets, 1 has all True, so the number of sheets with at least one False is 32 − 1 = 31.
Which is the base: nʳ or rⁿ?
The base is always the number of options each chooser has; the exponent is the number of choosers. Compare two problems with the same numbers.
| Problem | Choosers | Options each | Count |
|---|---|---|---|
| 4 letters are posted, each into one of 3 letter-boxes | 4 letters | 3 boxes | 3⁴ = 81 |
| 3 people each choose one of 4 trains | 3 people | 4 trains | 4³ = 64 |
In the first problem the letters choose boxes, not the other way round: every letter must go somewhere, and a box may receive many or none. So the answer is 3⁴ = 81, not 4³. In the second, each person picks one train and trains may carry many, so 4³ = 64. Ask: who must make a choice, and from what?
Worked example 3: numbers with repeated digits allowed
How many 5-digit numbers exist (the first digit cannot be 0)? The first place has 9 choices (1 to 9) and each of the other four places has 10. So the count is 9 × 10⁴ = 90 000. How many 3-digit numbers can be made from the digits 1, 2, 3 with repeats allowed? Each place has 3 choices, so 3³ = 27. Of these, those that are odd end in 1 or 3: the last place has 2 choices and the first two have 3 each, so 3 × 3 × 2 = 18.
Common mistakes
- Using ⁿPᵣ when the problem says digits or letters may be repeated.
- Using nʳ when objects cannot be reused (a race with distinct medals).
- Swapping n and r: always ask who is choosing.
- Forgetting the restriction on the first digit of a number.
Key takeaways: repeats allowed gives nʳ; n is the number of options for one chooser, r the number of choosers; "no repeat" turns the count into n(n − 1)(n − 2)…; the number with at least one repeat is the total minus the no-repeat count.
Check your understanding
-
1. How many 3-digit PINs can be formed using digits 0 to 9, with repeats allowed?
- 10 000
- 1 000
- 3 000
- 720
Show answer
Answer: B. Each of the 3 places has 10 choices, so 10³ = 1 000.
-
2. A quiz has 6 True/False questions. How many different answer sheets are possible?
- 12
- 36
- 720
- 64
Show answer
Answer: D. Each of the 6 questions has 2 answers, so 2⁶ = 64.
-
3. Five letters are each posted in one of 3 letter-boxes. How many ways are there?
- 243
- 125
- 15
- 60
Show answer
Answer: A. Each of the 5 letters chooses one of 3 boxes, so 3⁵ = 243. (5³ = 125 would be the count if the roles were swapped.)
-
4. How many 4-digit numbers exist (first digit not 0), with repeats allowed?
- 10 000
- 4 536
- 9 000
- 5 040
Show answer
Answer: C. The first place has 9 choices, the other three 10 each: 9 × 10³ = 9 000.
-
5. How many of the 10 000 four-digit PINs (0000 to 9999) have no repeated digit?
- 4 960
- 10 000
- 3 024
- 5 040
Show answer
Answer: D. 10 × 9 × 8 × 7 = 5 040. The 4 960 is the number with at least one repeat.
Sign in to keep track of the lessons you finish.