SOLUTIONS

1. 3k + 2 and 5k + 3, k ∈ are relatively prime

if, for all k , there exist m, n ∈ such that
m(3k + 2) + n(5k + 3) = 1 R1M1A1
⇒ 3m + 5n = 0 A1
2m + 3n = 1 A1
m = 5, n = –3 A1
hence they are relatively prime AG
[6]

2. (a) EITHER
3│m ⇒ m ≡ 0 (mod 3) (R1)
if this is false then m ≡ 1 or 2 (mod 3) and m2 ≡ 1 or 4 (mod 3) R1A1
since 4 ≡ 1(mod 3) then m2 ≡ 1(mod 3) A1
similarly n2 ≡ 1(mod 3) A1
hence m2 + n2 ≡ 2 (mod 3)
but m2 + n2 ≡ 0 (mod 3) (R1)
this is a contradiction so 3│m and 3│n R1AG

OR
m ≡ 0, 1 or 2 (mod 3) and n = 0, 1 or 2 (mod 3) M1R1
⇒ m2 ≡ 0 or 1 (mod 3) and n2 ≡ 0 or 1 (mod 3) A1A1
so m2 + n2 ≡ 0, 1, 2 (mod 3) A1
but 3| m2 + n2, so m2 + n2 ≡ 0 (mod 3) R1
m ≡ 0 (mod 3) and n ≡ 0 (mod 3) R1
⇒ 3│m and 3│n AG

a
(b) suppose 2= , where a, b ∈ and a and b are coprime M1
b
then
2b2 = a2 A1
a2 + b2 = 3b2 A1
3b2 ≡ 0 (mod 3) A1
a
but by (a) a and b have a common factor so 2≠ R1
b
⇒ 2 is irrational AG
[12]

IB Questionbank Mathematics Higher Level 3rd edition 1

3. (a) 457128 = 2 × 228 564
228 564 = 2 × 114 282
114 282 = 2 × 57141
57141 = 3 × 19047
19 047 = 3 × 6349
6349 = 7 × 907 M1A1
trial division by 11, 13, 17, 19, 23 and 29 shows that 907 is prime R1
therefore 457128 = 23 × 32 × 7 × 907 A1

n 6
(b) we require the least integer such that 2 2 ≥ 1010
taking logs twice gives M1M1
2n ln 2 ≥ 106 ln 10
 10 6 ln 10 
n ln 2 ≥ ln 

 ln 2 
= 6 ln 10 + ln ln 10 – ln ln 2
n ≥ 21.7 (A1)
least n is 22 A1

(c) by a corollary to Fermat’s Last Theorem

511 ≡ 5 (mod 11) and 1711 ≡ 17 (mod 11) M1A1
511 + 1711 ≡ 5 + 17 ≡ 0 (mod 11) A1
this combined with the evenness of LHS implies 25 | 511 + 1711 R1AG
[12]

4. (a) any clearly indicated method of dividing 1189 by successive numbers M1

find that 1189 has factors 29 and/or 41 A2
it follows that 1189 is not a prime number A1
Note: If no method is indicated, award A1 for the factors and A1 for
the conclusion.

(b) (i) every positive integer, greater than 1, is either prime or can be
expressed uniquely as a product of primes A1A1
Note: Award A1 for “product of primes” and A1 for “uniquely”.

IB Questionbank Mathematics Higher Level 3rd edition 2

 (ii) METHOD 1
let M and N be expressed as a product of primes as follows
M = AB and N = AC M1A1
where A denotes the factors that are common and B, C the
disjoint factors that are not common
it follows that G = A A1
and L = GBC A1
from these equations, it follows that
GL = A × ABC = MN AG
METHOD 2
Let M = 2 x1 × 3 x2 × ... p n xn and N = 2 y1 × 3 y 2 × ... p n y n where pn
denotes the nth prime M1
min( x n , y n )
Then G = 2 min( x1 , y1 ) × 3 min( x2 , y 2 ) × ... p n A1
and L = 2 max( x1 , y1 ) × 3 max( x2 , y 2 ) × ... p n max( xn , y n ) A1

It follows that GL = 2 x1 × 2 y1 × 3 x2 × 3 y 2 × ... × p n xn × p n y n A1

= MN AG
[10]

5. (a) 14641 (base a > 6) = a4 + 4a3 + 6a2 + 4a + 1, M1A1

= (a + 1)4 A1
this is the fourth power of an integer AG

a
(b) (i) aRa since = 1 = 20, hence R is reflexive A1
a
a b
aRb ⇒ = 2 k ⇒ = 2 −k ⇒ bRa
b a
so R is symmetric A1
a b
aRb and bRc ⇒ = 2m, m ∈ and bRc ⇒ = 2n, n ∈ M1
b c
a b a
⇒ × = = 2m+n, m + n ∈ A1
b c c
⇒ aRc so transitive R1
hence R is an equivalence relation AG

(ii) equivalence classes are {1, 2, 4, 8}, {3, 6} , {5,10} , {7}, {9} A3
Note: Award A2 if one class missing,
A1 if two classes missing,
A0 if three or more classes missing.
[11]

IB Questionbank Mathematics Higher Level 3rd edition 3

6. (a) N = an × 2n + an − 1 × 2n − 1 +... + a1 × 2 + a0 M1
If a0 = 0, then N is even because all the terms are even. R1
Now consider
n
a0 = N − ∑ a r × 2 r M1
r =1

If N is even, then a0 is the difference of two even numbers and

is therefore even. R1
It must be zero since that is the only even digit in binary arithmetic. R1

(b) N = an × 3n + an − 1 × 3n − 1 +... + a1 × 3 + a0

= an × (3n − 1) + an − 1 × (3n − 1 − 1) + ... + a1 × (3 − 1) + an

+ an − 1 + ... + a1 + a0 M1A1
+
Since 3n is odd for all n ∈ , it follows that 3n − 1 is even. R1
Therefore if the sum of the digits is even, N is the sum of even
numbers and is even. R1
Now consider

∑ a (3 )
n
an + an − 1 + ... + a1 + a0 = N − r
r
−1 M1
r =1

If N is even, then the sum of the digits is the difference of even

numbers and is therefore even. R1
[11]

IB Questionbank Mathematics Higher Level 3rd edition 4

7. consider the following

n (n2 + 2n + 3)(mod 8)
1 6
2 3
3 2
4 3
5 6
6 3
7 2
8 3

M1A2
we see that the only possible values so far are 2, 3 and 6 R1
also, the table suggests that these values repeat themselves but we have
to prove this
let f(n) = n2 + 2n + 3, consider
f(n + 4) – f(n) = (n + 4)2 + 2(n + 4) + 3 – n2 – 2n – 3 M1
= 8n + 24 A1
since 8n + 24 is divisible by 8, M1
f(n + 4) = f(n)(mod 8) A1
this confirms that the values do repeat every 4 values of n so that 2, 3 and 6
are the only values taken for all values of n R1
[9]

8. (a) a = λc + 1 M1
so ab = λbc + b ⇒ ab ≡ b (mod c) A1 AG

(b) the result is true for n = 0 since 90 = 1 ≡ 1 (mod 4) A1

assume the result is true for n = k, i.e. 9k ≡ 1(mod 4) M1
consider 9k+1 = 9 × 9k M1
≡ 9 × 1 (mod 4) or 1 × 9k (mod 4) A1
≡ 1 (mod 4) A1
so true for n = k ⇒ true for n = k + 1 and since true for n = 0
result follows by induction R1
Note: Do not award the final R1 unless both M1 marks have been awarded.
Note: Award the final R1 if candidates state n = 1 rather than n = 0

IB Questionbank Mathematics Higher Level 3rd edition 5

 (c) let M = (anan–1...a0)9 (M1)
= a × 9n + an–1 × 9n–1 + ... + a0 × 90 A1
EITHER
≡ an (mod 4) + an–1 (mod 4) + ... + a0 (mod 4) A1
≡ ∑a i (mod 4) A1
so M is divisible by 4 if ∑a i is divisible by 4 AG

OR
= an(9n – 1) + an–1(9n–1 – 1) + ... + a1(91 – 1)
+ an + an–1 + ... + a1 + a0 A1

Since 9n ≡ 1(mod 4), it follows that 9n – 1 is divisible by 4, R1

so M is divisible by 4 if ∑
a i is divisible by 4 AG
[12]

9. 67101 ≡ 2101 (mod 65) A1

26 ≡ –1 (mod 65) (M1)
2101 ≡ (26)16 × 25 A1
≡ (–1)16 × 32 (mod 65) A1
≡ 32 (mod 65) A1
∴ remainder is 32 A1 N2
[6]

IB Questionbank Mathematics Higher Level 3rd edition 6

10. EITHER
we work modulo 3 throughout
the values of a, b, c, d can only be 0, 1, 2 R2
since there are 4 variables but only 3 possible values, at least 2 of the
variables must be equal (mod 3) R2
therefore at least 1 of the differences must be 0 (mod 3) R2
the product is therefore 0 (mod 3) R1AG
OR
we attempt to find values for the differences that do not give 0 (mod 3)
for the product
we work modulo 3 throughout
we note first that none of the differences can be zero R1
a – b can therefore only be 1 or 2 R1
suppose it is 1, then b – c can only be 1
since if it is 2, (a – b) + (b – c) ≡ 3 ≡ 0(mod 3) R1
c – d cannot now be 1 because if it is
(a – b) + (b – c) + (c – d) = a – d ≡ 3 ≡ 0(mod 3) R1
c – d cannot now be 2 because if it is
(b – c) + (c – d) = b – d ≡ 3 ≡ 0(mod 3) R1
we cannot therefore find values of c and d to give the required result R1
a similar argument holds if we suppose a – b is 2, in which case b – c must
be 2 and we cannot find a value of c – d R1
the product is therefore 0 (mod 3) AG
[7]

11. (a) Let p1, ..., pn be the set of primes that divide either a or b M1
Then a = p1 p 2 ... p nα n and b = p1β1
α2 α2 β2
p 2 ... p nβ n A1A1
Hence ab = p1α1 + β1 p 2α 2 + β 2 ... p nα n + β n A1
Furthermore min{αj, βj} + max{αj, βj} = αj + βj for j = 1,2,...,n A1
Hence ab = p1min{α1 , β1 }+ max{α1 , β1 } ... p nmin{α n , β n }+ max{α n , β n } A1
ab = gcd(a,b) × lcm(a,b) AG

(b) gcd(a,b)│a and gcd(a,b)│b A1

Hence gcd(a,b)│a + b A1
so that gcd(a,b)│gcd(a,a + b) * A1
Also gcd(a,a + b)│a and gcd(a,b)│a + b A1
Hence gcd(a,a + b)│b A1
so that gcd(a,a + b)│gcd(a,b) ** A1
From * and ** : gcd(a,b) = gcd(a,a + b) A1AG
[13]

IB Questionbank Mathematics Higher Level 3rd edition 7

12. (a) 10201 = a × 84 + b × 83 + c × 82 + d × 8 + e M1
= 4096a + 512b + 64c + 8 d + e ⇒ a = 2 A1
= 10201 – 2 × 4096 = 2009 = 512b + 64c + 8d + e ⇒ b = 3
2009 – 3 × 512 = 473 = 64c + 8d + e ⇒ c = 7
473 – 7 × 64 = 25 = 8d + e ⇒ d = 3 and e = 1
10201 = 23731 (base 8) A2 N2

(b) 8n ≡ 1 (mod 7) for positive integer n A1

Consider the octal number
unun–1...u1u0 = un + un–1 + u1 + u0 (mod 7) (M1)
from which it follows that an octal number is divisible by 7 if and only if A1
the sum if the digits is divisible by 7. R1
Hence 10201 ≡ a + b + c + d + e (mod 7) A1

(c) 10201 ≡ 2 + 3 + 7 + 3 + 1 ≡ 2 (mod 7) A2

[11]

13. (a) let N = anan–1...a1a0 = an × 9n + an–1 × 9n–1 + ... + a1 × 9 + a0 M1A1

all terms except the last are divisible by 3 and so therefore is their sum R1
it follows that N is divisible by 3 if a0 is divisible by 3 AG

(b) EITHER
consider N in the form
n
N = an × (9n – 1) + an–1 × (9n–1 – 1) + ... + a1(9 – 1) + ∑a
i =0
i M1A1

all terms except the last are even so therefore is their sum R1
n
it follows that N is even if ∑a
i =0
i is even AG

OR
working modulo 2, 9k ≡ 1 (mod 2) M1A1
hence N = anan–1...a1a0 = an × 9n + an–1 × 9n–1 + ... + a1 × 9 + a0
n
≡ ∑a
i =0
i (mod 2) R1
n
it follows that N is even if ∑a
i =0
i is even AG

IB Questionbank Mathematics Higher Level 3rd edition 8

 (c) the number is divisible by 3 because the least significant digit is 3 R1
it is divisible by 2 because the sum of the digits is 44, which is even R1
dividing the number by 2 gives (232430286)9, M1A1
which is even because the sum of the digits is 30 which is even R1
N is therefore divisible by a further 2 and is therefore divisible by 12 R1
Note: Accept alternative valid solutions
[12]

14. (a) x ≡ y (mod n) ⇒ x = y + kn, (k ∈ ) A1

(b) x ≡ y(mod n)
⇒ x = y + kn M1
x2 = y2 + 2kny + k2n2 A1
⇒ x2 = y2 + (2ky + k2n) n M1A1
⇒ x2 ≡ y2 (mod n) AG

(c) EITHER
x2 ≡ y2 (mod n)
⇒ x2 − y2 = 0(mod n) M1
⇒ (x − y)(x + y) = 0(mod n) A1
This will be the case if
x + y = 0(mod n) or x = −y(mod n) R1
so x ≠ y(mod n) in general R1
OR
Any counter example, e.g. n = 5, x = 3, y = 2, in which case R2
x2 ≡ y2 (mod n) but x ≡/ y (mod n). (false) R1R1
[9]

IB Questionbank Mathematics Higher Level 3rd edition 9

15. (a) consider the decimal number A = anan–1, ... a0 M1
n n–1
A = an × 10 + an–1 × 10 + ... + a1 × 10 + a0 M1
n n–1
= an × (10 – 1) + an–1 × (10 – 1) + ... + a1 × (10 – 1)
+ an + an–1 + ... + a0 M1A1
= an × 99...9 (n digits) + an–1 × 99...9(n – 1 digits)
+ ... + 9a1 + an + an–1 + ... + a0 A1
all the numbers of the form 99…9 are divisible by 9 (to give 11…1), R1
n
hence A is divisible by 9 if ∑a
i =0
i is divisible by 9 R1

Note: A method that uses the fact that 10t ≡ 1 (mod 9) is equally valid.

(b) by Fermat’s Little Theorem 56 ≡ 1(mod 7) M1A1

(126)7 = (49 + 14 + 6)10 = (69)10 M1A1
5 (126 ) 7 ≡ 5 (11×6 + 3)10 ≡ 5 ( 3)10 (mod 7) M1A1
5 ( 3)10 = (125)10 = (17 × 7 + 6)10 ≡ 6 (mod 7) M1A1
hence a0 = 6 A1
[16]

16. (a) using Fermat’s little theorem n5 ≡ n(mod 5) (M1)

n5 – n ≡ 0 (mod 5) A1
now n5 – n = n(n4 – 1) (M1)
= n(n2 – 1)(n2 + 1)
= n(n – 1)(n + 1)(n2 + 1) A1
hence one of the first two factors must be even R1
i.e. n5 – n ≡ 0 (mod 2)
thus n5 – n is divisible by 5 and 2
hence it is divisible by 10 R1
in base 10, since n5 – n is divisible by 10, then n5 – n must end in
zero and hence n5 and n must end with the same digit R1

(b) consider n5 – n = n (n – 1) (n + 1) (n2 + 1)

this is divisible by 3 since the first three factors are consecutive integers R1
hence n5 – n is divisible by 3, 5 and 2 and therefore divisible by 30
in base 30, since n5 – n is divisible by 30, then n5 – n must end in zero and
hence n5 and n must end with the same digit R1
[9]

IB Questionbank Mathematics Higher Level 3rd edition 10

17. (a) EITHER
if p is a prime ap ≡ a(mod p) A1A1
OR
if p is a prime and a ≡/ 0(mod p) then ap–1 ≡ 1(mod p) A1A1
Note: Award A1 for p being prime and A1 for the congruence.

(b) a0 ≡ X (mod 7) M1
X = k × 56 + 25 + 15 + 5 – k
by Fermat 56 ≡ 1(mod 7) R1
X ≡ k + 45 – k (mod 7) (M1)
X ≡ 3 (mod 7) A1
a0 = 3 A1

(c) X = 2 × 56 + 25 + 15 + 3 = 31293 A1
EITHER
X – 75 = 14486 (M1)
X – 75 – 6 × 74 = 80
X – 75 – 6 × 74 – 72 = 31
X – 75 – 6 × 74 – 72 – 4 × 7 = 3
X = 75 + 6 × 74 + 72 + 4 × 7 + 3 (A1)
X = (160143)7 A1
OR
31293 = 7 × 4470 + 3 (M1)
4470 = 7 × 638 + 4
638 = 7 × 91 + 1
91 = 7 × 13 + 0
13 = 7 × 1 + 6 (A1)
X = (160143)7 A1
[11]

IB Questionbank Mathematics Higher Level 3rd edition 11

18. (a) EITHER
since gcd(a, b) = 1 and gcd(a, c) = 1 then
ax + by = 1 and ap + cq = 1 for x, y, p, q ∈ M1A1
hence
(ax + by)(ap + cq) = 1 A1
a(xap + xcq + byp) + bc (yq) = 1 M1
since (xap + xcq + byp) and (yq) are integers R1
then gcd(a, bc) = 1 AG
OR
if gcd(a, bc) ≠ 1, some prime p divides a and bc M1A1
⇒ p divides b or c M1
either gcd(a, b) or gcd(a, c) ≠ 1 A1
contradiction ⇒ gcd (a, bc) = 1 R1

[5]

19. (a) 324 = 2 × 129 + 66 M1

129 = 1 × 66 + 63
66 = 1 × 63 + 3 A1
hence gcd (324, 129) = 3 A1

(b) METHOD 1
Since 3 | 12 the equation has a solution M1
3 = 1 × 66 − 1 × 63 M1
3 = −1 × 129 + 2 × 66
3 = 2 × (324 − 2 × 129) − 129
3 = 2 × 324 − 5 × 129 A1
12 = 8 × 324 − 20 × 129 A1
(x, y) = (8, −20) is a particular solution A1
Note: A calculator solution may gain M1M1A0A0A1.
129
A general solution is x = 8 + t = 8 + 43t , y = − 20 − 108t , t ∈ A1
3

METHOD 2
324x + 129y = 12
108x + 43y = 4 A1
108x ≡ 4(mod 43) ⇒ 27x ≡ 1(mod 43) A1
x = 8 + 43t A1
108(8 + 43t) + 43y = 4 M1
864 + 4644t + 43y = 4
43y = −860 − 4644t
y = −20 −108t A1
a particular solution (for example t = 0) is (x, y) = (8, −20) A1

(c) EITHER

IB Questionbank Mathematics Higher Level 3rd edition 12

 The left side is even and the right side is odd so there are no
solutions M1R1AG
OR
gcd (82, 140) = 2 A1
2 does not divide 3 therefore no solutions R1AG
[11]

20. (a) 315 = 5 × 56 + 35 M1

56 = 1 × 35 + 21
35 = 1 × 21 + 14 A1
21 = 1 × 14 + 7
14 = 2 × 7 A1
therefore gcd = 7 A1

(b) (i) 7 = 21 – 14 M1
= 21 – (35 – 21)
= 2 × 21 – 35 (A1)
= 2 × (56 – 35) – 35
= 2 × 56 – 3 × 35 (A1)
= 2 × 56 – 3 × (315 – 5 × 56)
= 17 × 56 – 3 × 315 (A1)
therefore 56 × 51 + 315 × (–9) = 21 M1
x = 51, y = – 9 is a solution (A1)
the general solution is x = 51 + 45 N, y = –9 – 8N, N ∈ A1A1

(ii) putting N = –2 gives y = 7, which is the required value of x A1

[13]

IB Questionbank Mathematics Higher Level 3rd edition 13

21. 7854 = 2 × 3315 + 1224 M1A1
3315 = 2 × 1224 + 867 A1
1224 = 1 × 867 + 357
867 = 2 × 357 + 153
357 = 2 × 153 + 51
153 = 3 × 51 A1
The gcd is 51. A1
Since 51 does not divide 41, R1
there are no solutions. A1
[7]

22. (a) 12 306 = 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

(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)) – 2 (402)
= 5 (2976) – 37 (402) (A1)
= 5(2976) – 37(12 306 – 4(2976))
= 153(2976) – 37(12 306) (A1)
996 = 25 398(2976) – 6142(12 306)
⇒ x0 = –6142, y0 = 25 398 (A1)
 2976 
⇒ x = −6142 +  t = −6142 + 496t
 6 
 12306 
⇒ y = 25398 −  t = 25398 – 2051t M1A1A1
 6 
[14]

23. (a) ax ≡ b (mod p)

⇒ ap–2 × ax ≡ ap–2 × b (mod p) M1A1
⇒ ap–1x ≡ ap–2 × b(mod p) A1
but ap–1 ≡ 1(mod p) by Fermat’s little theorem R1
⇒ x = ap–2 × b (mod p) AG
Note: Award M1 for some correct method and A1 for correct statement.

IB Questionbank Mathematics Higher Level 3rd edition 14

 (b) (i) 17x ≡ 14(mod 21)
⇒ x ≡ 1719 × 14 (mod 21) M1A1
176 ≡ 1 (mod 21) A1
⇒ x ≡ (1)3 × 17 × 14 (mod 21) A1
⇒ x = 7 (mod 21) A1

(ii) x ≡ 7 (mod 21)

⇒ x = 7 + 21t, t ∈ M1A1
⇒ 17(7 + 21t) + 21y = 14 A1
⇒ 119 + 357t + 21y = 14
⇒ 21y = –105 – 357t A1
⇒ y = –5 – 17t A1
[14]

24. (a) (i) a ≡ d(mod n) and b ≡ c(mod n)

so a − d = pn and b − c = qn, M1A1
a − d + b − c = pn + qn
(a + b) − (c + d) = n (p + q) A1
(a + b) ≡ (c + d)(mod n) AG

2 x + 5 y ≡ 1 (mod 6)
(ii) 
 x + y ≡ 5 (mod 6)
adding 3x + 6y ≡ 0(mod 6) M1
6y ≡ 0(mod 6) so 3x ≡ 0(mod 6) R1
x ≡ 0 or x ≡ 2 or x ≡ 4(mod 6) A1A1A1
for x ≡ 0, 0 + y ≡ 5(mod 6) so y ≡ 5(mod 6) A1
for x ≡ 2, 2 + y ≡ 5(mod 6) so y ≡ 3(mod 6) A1
If x ≡ 4(mod 6), 4 + y ≡ 5(mod 6) so y ≡ 1(mod 6) A1

(b) Suppose x is a solution

97 is prime so x97 ≡ x (mod 97) M1
x97 − x ≡ 0(mod 97) A1
x97 − x + 1 ≡ 1 ≠ 0 (mod 97)
Hence there are no solutions R1
[14]

IB Questionbank Mathematics Higher Level 3rd edition 15

25. the mth term of the first sequence = 2 + 4 (m – 1) (M1)(A1)
the nth term of the second sequence = 7 + 5 (n – 1) (A1)
EITHER
equating these, M1
5n = 4m – 4
5n = 4(m – 1) (A1)
4 and 5 are coprime (M1)
+
⇒ 4│n so n = 4s or 5│(m – 1) so m = 5s + 1, s ∈ (A1)A1
thus the common terms are of the form {2 + 20s; s ∈ +} A1
OR
the numbers of both sequences are
2, 6, 10, 14, 18, 22
7, 12, 17, 22 A1
so 22 is common A1
identify the next common number as 42 (M1)A1
the general solution is {2 + 20s; s ∈ +} (M1)A1
[9]

26. (a) the relevant powers of 16 are 16, 256 and 4096
then
51966 = 12 × 4096 remainder 2814 M1A1
2814 = 10 × 256 remainder 254
254 = 15 × 16 remainder 14 A1
the hexadecimal number is CAFE A1
Note: CAFE is produced using a standard notation, accept explained
alternative notations.

(b) (i) using the Euclidean Algorithm (M1)

901 = 612 + 289 (A1)
612 = 2 × 289 + 34
289 = 8 × 34 + 17
gcd(901, 612) = 17 A1

(ii) working backwards (M1)

17 = 289 – 8 × 34
= 289 – 8 × (612 – 2 × 289)
= 17 × (901 – 612) – 8 × 612
= 17 × 901 – 25 × 612
so p = 17, q = –25 A1A1

IB Questionbank Mathematics Higher Level 3rd edition 16

 (iii) a particular solution is
s = 5p = 85, t = –5q = 125 (A1)
the general solution is
s = 85 + 36λ, t = 125 + 53λ M1A1
by inspection the solution satisfying all conditions is
(λ = –2), s = 13, t = 19 A1

(c) (i) the congruence is equivalent to 9x = 3 + 18λ (A1)

this has no solutions as 9 does not divide the RHS R1

(ii) the congruence is equivalent to 3x = 1 + 5λ, (3x ≡ 1(mod5)) A1

one solution is x = 2, so the general solution
is x = 2 + 5n (x ≡ 2 (mod 5)) M1A1
[19]

27. x ≡ 1(mod 3) ⇒ x = 3k + 1 A1
Choose k such that 3k + 1 ≡ 2 (mod 5) M1
With Euclid’s algorithm or otherwise we find
k ≡ 7 + 5h A1
Choose h such that 22 + 15k ≡ 3 (mod 7) M1
With Euclid′s algorithm or otherwise
k ≡ 2 + 7j A1
Hence x = 22 + 15(2 + 7j) = 52 + 105j A1 N3
[6]

28. (a) N = 3 + 11t M1

3 + 11 t ≡ 4(mod 9)
2t ≡ 1 (mod 9) (A1)
multiplying by 5, 10t ≡ 5 (mod 9) (M1)
t ≡ 5 (mod 9) A1
t = 5 + 9s M1
N = 3 + 11(5 + 9s)
N = 58 + 99s A1
58 + 99s ≡ 0(mod 7)
2 + s ≡ 0(mod 7)
s ≡ 5 (mod 7) A1
s = 5 + 7u M1
N = 58 + 99(5 + 7u)
N = 553 + 693u A1
Note: Allow solutions that are done by formula or an exhaustive,
systematic listing of possibilities.

IB Questionbank Mathematics Higher Level 3rd edition 17

 (b) u = 3 or 4
hence N = 553 + 2079 = 2632 or N = 553 + 2772 = 3325 A1A1
[11]

29. (a) (i) 48 = 65536 ≡ 7(mod9) A1

not valid because 9 is not a prime number R1
Note: The R1 is independent of the A1.

(ii) using Fermat’s little theorem M1

56 ≡ 1(mod 7) A1
therefore
(56)10 = 560 ≡ 1 (mod 7) A1
also, 54 = 625 M1
≡ 2(mod 7) A1
therefore
564 ≡ 1 × 2 ≡ 2 (mod 7) (so n = 2) A1
Note: Accept alternative solutions not using Fermat.

(b) EITHER
solutions to x ≡ 3 (mod 4) are
3, 7, 11, 15, 19, 23, 27, ... A1
solutions to 3x ≡ 2 (mod 5) are
4, 9, 14, 19 ... (M1)A1
so a solution is x = 19 A1
using the Chinese remainder theorem (or otherwise) (M1)
the general solution is x = 19 + 20n (n ∈ ) A1
(accept 19 (mod 20))

OR
x = 3 + 4t ⇒ 9 + 12t ≡ 2 (mod 5) M1A1
⇒ 2t ≡ 3 (mod 5) A1
⇒ 6t ≡ 9 (mod 5)
⇒ t ≡ 4 (mod 5) A1
so t = 4 + 5n and x = 19 + 20n (n ∈ ) M1A1
(accept 19 (mod 20))
Note: Also accept solutions done by formula.
[14]

IB Questionbank Mathematics Higher Level 3rd edition 18

30. (a) Multiply through by a p − 2.
a p − 1 x ≡ a p − 2 b(mod p) M1A1
Since, by Fermat’s little theorem, a p − 1 ≡ 1(mod p), R1
x ≡ a p − 2 b(mod p) AG

(b) Using the above result,

x ≡ 33 × 4(mod 5) ≡ 3(mod 5) M1A1
= 3, 8, 13, 18, 23,… (A1)
and x ≡ 55 × 6(mod 7) ≡ 4(mod 7) M1A1
= 4, 11, 18, 25,… (A1)
The general solution is
x = 18 + 35n M1
i.e. x ≡ 18(mod 35) A1
[11]

31. let x be the number of guests

x ≡ 1(mod 2)
x ≡ 1(mod 3)
x ≡ 1(mod 4)
x ≡ 1(mod 5)
x ≡ 1(mod 6)
x ≡ 0(mod 7) congruence (i) (M1)(A2)
the equivalent of the first five lines is
x ≡ 1(mod(lcm of 2, 3, 4, 5, 6)) ≡ 1(mod 60) A1
⇒ x = 60t + 1
from congruence (i) 60t + 1 ≡ 0 (mod 7) M1A1
60t ≡ – 1 (mod 7)
60t ≡ 6 (mod7)
4t ≡ 6 (mod 7)
2t ≡ 3 (mod 7) A1
⇒ t = 7u + 5 (or equivalent) A1
hence x = 420u + 300 + 1 A1
⇒ x = 420u + 301
smallest number of guests is 301 A1 N6
Note: Accept alternative correct solutions including exhaustion or formula
from Chinese remainder theorem.
[10]

IB Questionbank Mathematics Higher Level 3rd edition 19