Year 12 Mathematics Extension 2

Illustrations of proofs

Two worked questions, each with its solution and marking guidelines.

  • Questions at easy, medium and hard levels
  • As short answer and multiple choice
  • New numbers every time, from 5,000+ templates across NSW Years 7 to 12

Two worked examples

Question 12 marksMedium

A bag holds a very large number of counters in 11 different colours. What is the least number of counters that must be drawn, without looking, to be certain that at least 7 of them are the same colour?

Worked solution

Worst case: 7 - 1 counters of each of the 11 colours, that is 11(7−1)=6611(7 - 1) = 66 counters, with no colour reaching 7

One more counter forces 7 of one colour: 66+1=6766 + 1 = 67

Answer

6767

Marking guidelines

Finds the largest number of counters that can be drawn without reaching the required number of one colour

1 mark

Adds one more counter to guarantee the required number

1 mark

Report a problem with this question.

Question 23 marksHarder

Integers are chosen from 1,2,…,N1, 2, \ldots, N, where N=2×20×5N = 2 \times 20 \times 5. What is the least number of integers that must be chosen to be certain that two of them differ by exactly 2020?

Worked solution

N=2×20×5=200N = 2 \times 20 \times 5 = 200, so split 1,2,…,2001, 2, \ldots, 200 into 55 blocks of 4040 consecutive integers

In each block the integers pair up as (x,x+20)(x, x + 20), giving 2020 pairs, so a set with no two differing by 2020 has at most 2020 integers per block, which is at most 100100 in total, and 100100 can be reached

So 100+1=101100 + 1 = 101 integers must be chosen

Answer

101101

Marking guidelines

Splits the integers into blocks or pairs whose members differ by the stated amount

1 mark

Finds the most integers that can be chosen with no such pair

1 mark

Adds one to guarantee a pair

1 mark

Report a problem with this question.

Not affiliated with NESA.