Date | May 2018 | Marks available | 4 | Reference code | 18M.3dm.hl.TZ0.4 |
Level | HL only | Paper | Paper 3 Discrete mathematics | Time zone | TZ0 |
Command term | Show that | Question number | 4 | Adapted from | N/A |
Question
Show that gcd(4k+2,3k+1)=gcd(k−1,2), where k∈Z+,k>1.
State the value of gcd(4k+2,3k+1) for odd positive integers k.
State the value of gcd(4k+2,3k+1) for even positive integers k.
Markscheme
METHOD 1
attempting to use the Euclidean algorithm M1
4k+2=1(3k+1)+(k+1) A1
3k+1=2(k+1)+(k−1) A1
K+1=(k−1)+2 A1
=gcd(k−1,2) AG
METHOD 2
gcd(4k+2,3k+1)
=gcd(4k+2−(3k+1),3k+1) M1
=gcd(3k+1,k+1)(=gcd(k + 1,3k + 1)) A1
=gcd(3k+1−2(k+1),k+1)(=gcd(k−1,k+1)) A1
=gcd(k+1−(k−1),k−1)(=gcd(2,k−1)) A1
=gcd(k−1,2) AG
[4 marks]
(for k odd), gcd(4k+2,3k+1)=2 A1
[1 mark]
(for k even), gcd(4k+2,3k+1)=1 A1
[1 mark]