Product counting and estimating powers/roots
8 exam-style questions, grades 5 to 9. Worked solutions and the marks are on the last page.
- Question 1
A code is made from two letters of the alphabet (A to Z) followed by three digits (0 to 9).
(a) How many different codes are possible?
(b) How many codes are possible if the two letters must be different?
- Question 2
A café menu has 4 starters, 6 main courses and 3 desserts.
(a) How many different three-course meals (one starter, one main and one dessert) are possible?
(b) Lucy chooses a main course and exactly one other course (a starter or a dessert). How many different choices can she make?
- Question 3
(a) A label consists of two different letters chosen from A, B, C, D and E, followed by one digit chosen from 1 to 7. How many different labels are possible?
- Question 4
(a) Find the largest number with one decimal place that is less than Show how squaring can be used to check your answer.
- Question 5
A three-digit number has no repeated digits and cannot start with 0.
(a) How many such three-digit numbers are even?
- Question 6
(a) Seven students are available for three different roles: chair, secretary and treasurer. Each role is held by a different student. Two particular students, Isha and Leon, must not both be given roles. How many assignments are possible?
- Question 7
Three-digit even integers are formed from 0, 1, 2, 3 and 4 without repeating a digit.
(a) Find how many such integers are possible.
(b) Explain why treating 0, 2 and 4 identically in the last position gives an incorrect count.
- Question 8
(a) How many six-digit positive integers can be made using each of the digits 0, 1, 2, 3, 4 and 5 exactly once, if the integer must be divisible by 4? A six-digit integer cannot begin with 0.
Worked solutions and marks
Question 1
(a)
- Multiply the number of choices for each position.
- M1 Multiplying the choices, such as .
- A1 The correct answer, .
(b)
- The second letter has only 25 choices.
- M1 Using for the letters.
- A1 The correct answer, .
Question 2
(a)
- .
- B1 The correct answer, .
(b)
- Main and starter: . Main and dessert: .
- The two cases cannot both happen, so add: .
- M1 Finding one case: 24 or 18.
- A1 The correct answer, .
Question 3
(a)
- The first letter has 5 choices and the second has 4 because repetition is not allowed.
- The digit has 7 choices. The product rule gives 5 4 7 = 140 labels.
- P1 Establishing or an equivalent valid method.
- A1 Correct answer:
Question 4
(a) 8.6
- For positive numbers, squaring preserves their order.
- = 73.96 < 75, but = 75.69 > 75.
- Therefore 8.6 < < 8.7, so the required number is 8.6.
- P1 Establishing or an equivalent valid method.
- P1 Establishing or an equivalent valid method.
- C1 Correct conclusion with the complete supporting argument: 8.6
Question 5
(a)
- Split by the last digit, because 0 affects the first digit.
- Last digit 2, 4, 6 or 8: the first digit can be any of 1 to 9 except the last digit (8 choices), and the middle any of the 8 digits left.
- P1 Splitting into cases: last digit 0, and last digit 2, 4, 6 or 8.
- P1 Counting the last-digit-0 case correctly: 72.
- P1 Counting the other case correctly: .
- A1 The correct answer, .
Question 6
(a)
- Ignoring the restriction, the product rule gives 7 6 5 = 210 assignments.
- If Isha and Leon both hold roles, choose the third person in 5 ways and arrange the three people in 3 2 1 = 6 ways: 30 forbidden assignments.
- Subtract these assignments: 210 30 = 180.
- P1 Establishing or an equivalent valid method.
- P1 Establishing or an equivalent valid method.
- A1 Correct answer:
Question 7
(a)
- If the last digit is zero there are four then three choices.
- For either non-zero even last digit there are three then three choices.
- Add the disjoint cases.
- Therefore .
- P1 If the last digit is zero there are four then three choices.
- P1 For either non-zero even last digit there are three then three choices.
- P1 Add the disjoint cases.
- A1 Correct answer:
(b) When zero is last it cannot also be first. When 2 or 4 is last, zero remains available but must be excluded from the first position.
- When zero is last it cannot also be first. When 2 or 4 is last, zero remains available but must be excluded from the first position.
- C1 Correct conclusion with supporting reasoning: When zero is last it cannot also be first. When 2 or 4 is last, zero remains available but must be excluded from the first position.
Question 8
(a)
- Divisibility by 4 depends on the last two digits. With these distinct digits, the possible endings are 04, 12, 20, 24, 32, 40 and 52.
- For the 3 endings containing 0, the other four digits can be arranged in 4 3 2 1 = 24 ways each.
- For the other 4 endings, 0 is among the remaining digits. There are 3 choices for the first digit and 3 2 1 choices for the others, giving 18 ways each.
- Total = 3 24 + 4 18 = 144.
- P1 Establishing or an equivalent valid method.
- P1 Establishing or an equivalent valid method.
- P1 Establishing or an equivalent valid method.
- A1 Correct answer: