A brief note on The Fundamental Principle of Counting . Read it before a test. Try each question at the end before you open its answer.
The multiplication principle An event in m m m ways, then another in n n n ways: m × n m \times n m × n ways in all. It extends to any number of stages. A tree diagram shows why. Every branch splits into the same number of branches. With repetition , each place keeps all its choices: k k k places with n n n choices give n k n^k n k . Without repetition , each place has one choice fewer: n × ( n − 1 ) × ( n − 2 ) × … n \times (n - 1) \times (n - 2) \times \dots n × ( n − 1 ) × ( n − 2 ) × … A number cannot start with 0 0 0 . The addition principle A task in m m m ways OR in n n n other ways: m + n m + n m + n ways, if no way is in both. Stages one after another: multiply. Separate cases: add. Split a hard count into cases that cannot overlap, count each, then add. Fill the place that has a rule first, such as an even or odd last digit. Factorials n ! = 1 × 2 × ⋯ × n n! = 1 \times 2 \times \dots \times n n ! = 1 × 2 × ⋯ × n , and 0 ! = 1 0! = 1 0 ! = 1 . n ! = n × ( n − 1 ) ! n! = n \times (n - 1)! n ! = n × ( n − 1 )! , so each factorial comes from the one before. Cancel before multiplying: n ! ( n − 2 ) ! = n ( n − 1 ) \dfrac{n!}{(n - 2)!} = n(n - 1) ( n − 2 )! n ! = n ( n − 1 ) . A product of k k k numbers counting down from n n n is n ! ( n − k ) ! \dfrac{n!}{(n - k)!} ( n − k )! n ! . ( 2 n ) ! ≠ 2 × n ! (2n)! \neq 2 \times n! ( 2 n )! = 2 × n ! , and ( a + b ) ! ≠ a ! + b ! (a + b)! \neq a! + b! ( a + b )! = a ! + b ! . A worked example How many 4 4 4 -digit numbers with four different digits are greater than 6000 6000 6000 ?
The first digit. It must be 6 6 6 , 7 7 7 , 8 8 8 or 9 9 9 : 4 4 4 ways. The other places. Nine digits are left for the second place, then 8 8 8 and 7 7 7 . Multiply. 4 × 9 × 8 × 7 = 2016 4 \times 9 \times 8 \times 7 = 2016 4 × 9 × 8 × 7 = 2016 numbers. Practice with new numbers
A program to try The program checks the three rules of this note by listing: a product of choices, a sum of separate cases, and the factorial rule.
Run it. Do the listed counts agree with the rules?
1. Add the digit 4 to the code's last place. Predict the new count first.
Mistakes to avoid Adding stages. Choices one after another multiply. Keeping every choice without repetition. Each place loses one choice. Overlapping cases. Add only cases with nothing in common. 0 ! = 0 0! = 0 0 ! = 0 . It is 1 1 1 . Cancelling inside a factorial. 8 ! 4 ! \dfrac{8!}{4!} 4 ! 8 ! is 8 × 7 × 6 × 5 8 \times 7 \times 6 \times 5 8 × 7 × 6 × 5 , not 2 ! 2! 2 ! . Check yourself A password is one letter from A to Z followed by 2 2 2 digits, which may repeat. How many passwords are there? Stuck? Show a hint Show the answerDev chooses either one of 6 6 6 films or one of 4 4 4 plays. How many choices does he have? Stuck? Show a hint Show the answerHow many 3 3 3 -digit numbers with different digits end in 0 0 0 ? Stuck? Show a hint Show the answerFind 14 ! 12 ! \dfrac{14!}{12!} 12 ! 14 ! . Stuck? Show a hint Show the answerWhy is 0 ! = 1 0! = 1 0 ! = 1 ? Stuck? Show a hint Show the answer