Shared birthdays in a group of 367 people
A club has members. A year has at most possible birthdays, including February.
The club secretary wants to prove, by contradiction, that at least two members of the club share a birthday.
(a) Write down the assumption the secretary should make to begin the proof. (1)
(b) Complete the proof. (2)
- 1
(a) The negation of “at least two members share a birthday” is that no two members share a birthday, so all birthdays are different. B1
- 2
(b) If all birthdays are different, each member uses up a different day, so at least different days are needed. M1
- 3
, so there are not enough days: this is a contradiction. Hence the assumption is false and at least two members share a birthday. A1 cso
Answer
(a) Assume that no two members share a birthday (all birthdays are different). (b) That needs different days, but there are at most : a contradiction, so at least two members share a birthday.
Examiner tip
The B1 needs the negation of the whole statement: “all the birthdays are different” or “no two share a birthday”. Writing “assume two members do not share a birthday” is not the negation and loses the mark. The final A1 needs the word contradiction (or an equivalent) and a concluding sentence that restates the result.