Date | May 2009 | Marks available | 14 | Reference code | 09M.3dm.hl.TZ0.2 |
Level | HL only | Paper | Paper 3 Discrete mathematics | Time zone | TZ0 |
Command term | Question number | 2 | Adapted from | N/A |
Question
(a) Use the Euclidean algorithm to find gcd(12306, 2976) .
(b) Hence give the general solution to the diophantine equation 12306x + 2976y = 996 .
Markscheme
(a) 12306=4×2976+402 M1
2976=7×402+162 M1
402=2×162+78 A1
162=2×78+6 A1
78=13×6
therefore gcd is 6 R1
[5 marks]
(b) 6|996 means there is a solution
6=162−2(78) (M1)(A1)
=162−2(402−2(162))
=5(162)−2(402) (A1)
= 5(2976) - 7(402)} \right) - 2(402)
=5(2976)−37(402) (A1)
=5(2976)−37(12306−4(2976))
=153(2976)−37(12306) (A1)
996=25398(2976)−6142(12306)
⇒x0=−6142, y0=25398 (A1)
⇒x=−6142+(29766)t=−6142+496t
⇒y=25398−(123066)t=25398−2051t M1A1A1
[9 marks]
Total [14 marks]
Examiners report
Part (a) of this question was the most accessible on the paper and was completed correctly by the majority of candidates. Most candidates were able to start part (b), but a number made errors on the way and quite a number failed to give the general solution.