7.01f Combinations: unordered subsets of r from n elements

1 Alfie has a set of 15 cards numbered consecutively from 1 to 15.
He chooses two of the cards.

1. How many different sets of two cards are possible? Alfie places the two cards side by side to form a number with 2,3 or 4 digits.
2. Explain why there are fewer than \({ } ^ { 15 } \mathrm { P } _ { 2 } = 210\) possible numbers that can be made.
3. Explain why, with these cards, 1 is the lead digit more often than any other digit. Alfie makes the number 113, which is a 3-digit prime number. Alfie says that the problem of working out how many 3-digit prime numbers can be made using two of the cards is a construction problem, because he is trying to find all of them.
4. Explain why Alfie is wrong to say this is a construction problem.

4 The first 20 consecutive positive integers include the 8 prime numbers \(2,3,5,7,11,13,17\) and 19. Emma randomly chooses 5 distinct numbers from the first 20 consecutive positive integers. The order in which Emma chooses the numbers does not matter.

1. Calculate the number of possibilities in which Emma's 5 numbers include exactly 2 prime numbers and 3 non-prime numbers.
2. Calculate the number of possibilities in which Emma's 5 numbers include at least 2 prime numbers. The pairs \(\{ 3,13 \}\) and \(\{ 7,17 \}\) each consist of numbers with a difference of exactly 10 .
3. Calculate the number of possibilities in which Emma's 5 numbers include at least one pair of prime numbers in which the difference between them is exactly 10 . A new set of 20 consecutive positive integers, each with at least two digits, is chosen. This set of 20 numbers contains 5 prime numbers.
4. Use the pigeonhole principle to show that there is at least one pair of these prime numbers for which the difference between them is exactly 10 .

3 Bob has been given a pile of five letters addressed to five different people. He has also been given a pile of five envelopes addressed to the same five people. Bob puts one letter in each envelope at random.

1. How many different ways are there to pair the letters with the envelopes?
2. Find the number of arrangements with exactly three letters in the correct envelopes.
3. (a) Show that there are two derangements of the three symbols A , B and C .
   (b) Hence find the number of arrangements with exactly two letters in the correct envelopes. Let \(\mathrm { D } _ { n }\) represent the number of derangements of \(n\) symbols.
4. Explain why \(\mathrm { D } _ { n } = ( n - 1 ) \times \left( \mathrm { D } _ { n - 1 } + \mathrm { D } _ { n - 2 } \right)\).
5. Find the number of ways in which all five letters are in the wrong envelopes.