AMC Lecture 9
AMC Lecture 9
Unlike complementary counting, which uses subtraction, the methods that we will discuss in this lecture use division to
correct for overcounting
Let start with a problem that we should (hopefully) already know how to do.
Problem : How many possible distinct arrangements are there of the letters in the word DOG?
We could list them: DOG, DGO, ODG, OGD, GDO, GOD : 6 ways
OR: We could have noticed that we have 2 ways to pick the first letter
2 ways left to pick the second
1 way to pick the third
Total: 3! = 6
The problem above is just a basic permutation problem. Let's add a new wrinkle to this type of problem.
Problem: How many possible distinct arrangements are there of the letters in the word BALL?
Unfortunately, this method overcounts. The reason for this is that two of our letters are the same.
Let's pretend that the two L's are different, and call them L_1 and L_2.
But when we remove the numbers, we have BALL and BALL, which are the same ==> We have overcounted and we need to
correct for this.
Every possible arrangement of BALL is counted twice among our arrangements of BAL_1L_2
Thus, to get the number of arrangements of BALL, we have to divide the number of arrangements of BAL_1L_2 by 2.
Answer:
Hint: If we pretend that all the T's are different, then there are …………….ways (overcounting)
However, for any give arrangement, the 3 T's can be rearranged in ………….ways
Correcting:
Problem: Find a formula for the sum of the first n positive integers
Problem: A round-robin tennis tournament consists of each player playing every other player exactly once. How many
matches will be held during an 8-person round-robin tennis tournament?
A) 28
B) 30
C) 50
D) 56
Sol 1: Each of the eight player plays 7 games => there are 8 x7 = 56 games (overcounting)
Okay, so when we count the total number of matches as 8 x 7 = 56, the match between Alex and Chris is counted twice
Correcting: ……
A plays ………matches
B plays………matches
Total:
Problem: A round-robin tennis tournament consists of each player playing every other player exactly once. How many
matches will be held during a n-person round-robin tennis tournament, where n >2 is an integer?
Problem: In how many different ways can 6 people be seated at a round table? Two seating arrangements are considered the
same, if, for each person, the person to his or her left is the same in both arrangements.
If the 6 people were sitting in a row, rather than around a table, there is …. …….arrangements (overcounting)
How many arrangements of the people from A through F correspond to the same arrangement.