Summary
If one job can be done in m ways and, for each of these, a second job can be done in n ways, then the two jobs done one after the other can be done in m × n ways. The key word is AND: when every step must be completed, multiply the number of choices at each step.
To count numbers with digit conditions, draw one box for each place and write the number of choices in each box. Fill the restricted places first (for example the first digit of an n-digit number cannot be 0, and the last digit of an even number must be even). Then multiply.
Key formulas
- Factorial
- n! = n(n − 1)(n − 2) … 3·2·1
- Recursion
- n! = n × (n − 1)!
- Zero factorial
- 0! = 1
- Multiplication principle
- m × n ways (job 1 AND job 2)
- Addition principle
- m + n ways (job 1 OR job 2)
- Overlapping groups
- n(A or B) = n(A) + n(B) − n(A and B)
- n-digit numbers (repetition allowed)
- 9 × 10ⁿ⁻¹
- Subsets of an n-element set
- 2ⁿ (2ⁿ − 1 non-empty)
What this note covers
- Multiplication principle
- Addition principle
- Factorial notation
Solved past-paper question (MHT-CET 2024, 2023)
The number of all four digit numbers which begin with 4 and end with either zero or five is
- (A) 200
- (B) 64
- (C) 256
- (D) 32
Solution
A four-digit number has four places. The first place is fixed as 4, so it has 1 choice.
1 choice for the thousands place
The last place must be 0 or 5, so it has 2 choices.
2 choices for the units place
The two middle places are free. Repetition is allowed, so each has 10 choices (0 to 9).
10 × 10 = 100 ways
Multiply the choices of all the places.
1 × 10 × 10 × 2 = 200
Answer: (A) 200
Common mistake: Giving the last place 10 choices instead of 2, or forgetting that the first place is fixed.
The full note has 6 solved questions, 6 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.
PDF download is included in PrepKi plans. See plans.