Number theory

Question bank
Unit I
1. Define divisibility.
2. Let a,b,c,d be any nonzero integers. Prove that
(i) If 𝑎|𝑏 𝑎𝑛𝑑 𝑏|𝑐 𝑡ℎ𝑒𝑛 𝑎| 𝑐
(ii) If 𝑎|𝑏 𝑎𝑛𝑑 𝑐|𝑑 𝑡ℎ𝑒𝑛 𝑎𝑐| 𝑏𝑑
(iii)If m is nonzero integer then 𝑎|𝑏 𝑖𝑓𝑓 𝑚𝑎| 𝑚𝑏.
(iv) If d is a nonzero integer such that 𝑑|𝑎, 𝑎 ≠ 0 𝑡ℎ𝑒𝑛 |𝑑| ≤ |𝑎|
(v) If 𝑎|𝑥, 𝑎|𝑦 then 𝑎|𝑐𝑥 + 𝑑𝑦 for any integers c,d.
(vi) 𝑎|𝑏 𝑎𝑛𝑑 𝑏|𝑎 𝑖𝑓𝑓 𝑎 = ∓𝑏.
3. If a and b are integers with 𝑏 ≠ 0, then prove that there is a unique pair of integers q
and r such that 𝑎 = 𝑞𝑏 + 𝑟 𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑟 < 𝑏.
4. Using division algorithm prove that the square of any integer is either of the form 3k or
3k+1
5. Using division algorithm prove that the cube of any integer hs one of the forms: 9k,
9k+1, or 9k+8.
6. If 𝑎|𝑏, show that (−𝑎)|𝑏, 𝑎|(−𝑏) and (−𝑎)|(−𝑏) .
7. Given integers 𝑎, 𝑏, 𝑐, 𝑑, verify the following:
(a) . lf 𝑎|𝑏, then 𝑎|𝑏𝑐.
(b) . If a I b and 𝑎 |𝑐, then 𝑎2 | 𝑏𝑐.
(c) . 𝑎 | 𝑏 if and only if 𝑎𝑐|𝑏𝑐, where 𝑐 ≠ 0.
(d) If a I b and 𝑐|𝑑, then 𝑎𝑐|𝑏𝑑
8. If a and b are two integers, not both zero prove that there exists integers x and y such
that gcd(𝑎, 𝑏) = 𝑎𝑥 + 𝑏𝑦.
9. For 𝑛 ≥ 1, use mathematical induction to prove the following divisibility
(a) 8|52𝑛 + 7
(b) 15|24𝑛 − 1
10. Let , b be integers, not both zero. For a positive integer d, 𝑑 = gcd(𝑎, 𝑏) iff a)
𝑑|𝑎 & 𝑑|𝑏 (b) whenever 𝑐|𝑎 𝑎𝑛𝑑 𝑐|𝑏, 𝑡ℎ𝑒𝑛 𝑐|𝑑.
11. If 𝑎 = 𝑞𝑏 + 𝑟, then prove that 𝑔𝑐𝑑(𝑎, 𝑏) = 𝑔𝑐𝑑(𝑏, 𝑟).
12. Use the Euclidean algorithm to obtain integers x & y satisfying the following
i) gcd(12378,3054) = 12378𝑥 + 3054𝑦
ii) gcd(254,32) = 254𝑐 + 32𝑦.
iii) gcd(74,383) = 74𝑥 + 383𝑦.
iv) gcd(56,72) = 56𝑥 + 72𝑦.
v) gcd(24,138) = 24𝑥 + 138𝑦.
vi) gcd(119,272) = 119𝑥 + 272𝑦.
vii) 𝑔𝑐𝑑(1769,2378) = 1769𝑥 + 2378𝑦.
13. If 𝑘 > 0, then show that 𝑔𝑐𝑑(𝑘𝑎, 𝑘𝑏) = 𝑘𝑔𝑐𝑑(𝑎, 𝑏) the linear Diophantine equation
𝑎𝑥 + 𝑏𝑦 = 𝑐 has a solution iff 𝑑|𝑐, where d=gcd(a,b). If 𝑥0 , 𝑦0 is any particular solution of
𝑏 𝑎
this equation then all other solutions are given by 𝑥 = 𝑥0 + (𝑑)𝑡, 𝑦 = 𝑦0 − (𝑑)𝑡.
14. Determine all solutions in the integers of the following Diophantine equations.
i) 56x+72y=40
ii) 24x+138y=18
iii) 221x+35y=11.
 15. Determine all solutions in the positive integers of the following Diophantine eqution
i) 18x+5y=48
ii) 54x+21y=906
iii) 172x+20y=1000.
16. A customer bought a dozen pieces of fruits, apples and oranges for Rs.132. If an apple
costs Rs.3 more than an orange and more apples than oranges were purchased, how
many pieces of each kind were bought?
17. The neighbourhood theatre charges $1.80 for adult admission and $0.75 for children.
On a particular evening the total receipts were $90. Assuming that more adults than
children were present, how many people attended?
18. If p is a prime and 𝑝|𝑎𝑏, then prove that 𝑝|𝑎 𝑜𝑟 𝑝|𝑏 .
19. prove that every positive integer 𝑛 > 1 is either a prime or a product of primes this
representation is unique.
20. Find prime factorization of the integers 1234, 10140, 36000, 4725.
21. Prove that the congruence ′ ≡ ′ is an equivalence relation on set of integers.
22. For 𝑛 > 1 and 𝑎, 𝑏, 𝑐, 𝑑 are arbitrary integers, then prove the following properties.
i) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) & 𝑐 ≡ 𝑑 (𝑚𝑜𝑑 𝑛) then 𝑎 + 𝑐 ≡ 𝑏 + 𝑑 (𝑚𝑜𝑑 𝑛) and 𝑎𝑐 ≡
𝑏𝑑 (𝑚𝑜𝑑 𝑛).
ii) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) then 𝑎 + 𝑐 ≡ 𝑏 + 𝑐 (𝑚𝑜𝑑 𝑛) and 𝑎𝑐 ≡ 𝑏𝑐 (𝑚𝑜𝑑 𝑛).
iii) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) then 𝑎𝑘 ≡ 𝑏 𝑘 (𝑚𝑜𝑑 𝑛) for any integrs k.
23. Prove each of the following
(a) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) and m In, then 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑚).
(b) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) and 𝑐 > 0, then ca= cb (mod en).
(c) If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) and the integers 𝑎, 𝑏, 𝑛 are all divisible by 𝑑 > 0, then 𝑎/𝑑 ≡
𝑏/𝑑 (𝑚𝑜𝑑 𝑛/𝑑)
24. Show that 41 divides 220 − 1.
25. Find remainders when 250 and 4165 are divided by 7.
26. Prove that the integers 53103 + 10353 is divisible by 39, and that 111333 + 333111 is
divisible by 7
27. Use theory of congruence to verify that 89|244 − 1 and 97|248 − 1.
28. What is the remainder when the following sum is divided by 4?
15 + 25 + 35 + ⋯ … . +995 + 1005
29. What is the remainder of 1!+2!+3!+….+100! Divided by 24.
30. Use the theory of congruences to verify that 89|244 − 1 and 97|248 – 1.
31. Prove that the congruence 𝑎𝑥 ≡ 𝑏(𝑚𝑜𝑑 𝑛) has a solution if and only if gcd(a,n)
divides b.
32. The linear congruence 𝑎𝑥 ≡ 𝑏(𝑚𝑜𝑑 𝑛) has solution if 𝑑|𝑏 where gcd(a,n)=d. Prove
that it has exactly d incongruent solutions modulo n.
33. Solve the following linear congruences:
i) 25𝑥 = 15 (𝑚𝑜𝑑 29).
ii) 5𝑥 = 2 (𝑚𝑜𝑑 26).
iii) 6𝑥 = 15 (𝑚𝑜𝑑 21).
iv) 36𝑥 = 8 (𝑚𝑜𝑑 102).
v) 34𝑥 = 60 (𝑚𝑜𝑑 98).
vi) 140𝑥 = 133 (𝑚𝑜𝑑 301).
34. Using congruences, solve the Diophantine equations below
i) 4x +51y = 9.
ii) 12x + 25y = 331.
 35. When eggs in a basket are removed 2, 3, 4, 5, 6 at a time there remain, respectively, 1,
2, 3, 4, 5 eggs. When they are taken out 7 at a time, none are left over. Find the
smallest number of eggs that could have been contained in the basket.
36. Solve each of the following sets of simultaneous congruences: ]
i). 𝑥 = 1 (𝑚𝑜𝑑 3), 𝑥 = 2 (𝑚𝑜𝑑 5), 𝑥 = 3 (𝑚𝑜𝑑 7).
ii). 𝑥 = 5 (𝑚𝑜𝑑 11), 𝑥 = 14 (𝑚𝑜𝑑 29), 𝑥 = 𝑙𝑆 (𝑚𝑜𝑑 31).
iii). x = 5(mod 6), x = 4 (mod 11), x = 3 (mod 17).
37. Find the solutions of each of the following systems of congruences:
i) 5x + 3y = 1 (mod 7)
3x + 2y = 4 (mod 7).

ii) 7x + 3y = 6 (mod 11)

4x + 2y = 9 (mod 11).

iii) 11x + 5y = 7 (mod 20)

6x + 3y = 8 (mod 20).

iv) 7x + 3y = 10 (mod 16)

2x + 5y = 9 (mod 16)

Unit II
1. Use Fermat's theorem to verify that 17 divides 11104 + 1
2. If 𝑔𝑐𝑑(𝑎, 35) = 1, show that 𝑎12 ≡ 1 (𝑚𝑜𝑑 35). [Hint: From Fermat's theorem a6
= 1 (mod 7) and a4 = 1 (mod 5).]
3. If 𝑔𝑐𝑑(𝑎, 42) = 1, show that 168 = 3 · 7 · 8 divides 𝑎6 − 1.
4. If 𝑔𝑐𝑑(𝑎, 133) = 𝑔𝑐𝑑(𝑏, 133) = 1, show that 133| 𝑎18 − 𝑏18 .
5. Show that 18! = -1 (mod 437).
6. Derive each of the following congruences: (a) 𝑎21 ≡ 𝑎 (𝑚𝑜𝑑 15) for all 𝑎. [Hint: By
Fermat's theorem, 𝑎5 = 𝑎 (𝑚𝑜𝑑 5).]
(c) 𝑎7 ≡ 𝑎 (𝑚𝑜𝑑 42) for all a. (c) 𝑎13 ≡ 𝑎 (𝑚𝑜𝑑 3 · 7 · 13) for all 𝑎. (d) 𝑎9 ≡
𝑎 (𝑚𝑜𝑑 30) for all 𝑎.
7. If 𝑝 and 𝑞 are distinct primes, prove that 𝑝𝑞−1 + 𝑞 𝑝−1 ≡ 1 (𝑚𝑜𝑑 𝑝𝑞)
8. Determine whether 17 is a prime by deciding whether 16! ≡ −1 (𝑚𝑜𝑑 17).
9. Prove that If 𝑝 is a prime, then (𝑝 − 1) ! ≡ −1 (𝑚𝑜𝑑 𝑝 ).
10. Find the remainder when 15! is divided by 17.
11. Find the remainder when 2(26!) is divided by 29.
12. Using Wilson's theorem, prove that for any odd prime p, 12 · 32 · 52 · · ·
𝑝+ 1
(𝑝 − 2)2 = (−1) 2 (𝑚𝑜𝑑 𝑝).
𝑝−1
13. For a prime p of the form 4k + 3, prove that either ( 2 ) ! ≡ 1 (𝑚𝑜𝑑 𝑝) or
𝑝−1
( 2 ) ! ≡ −1 (𝑚𝑜𝑑 𝑝)
14. If p and q are distinct primes, prove that for any integer 𝑎, 𝑝𝑞 |𝑎𝑝𝑞 − 𝑎𝑝 − 𝑎𝑞 + 𝑎.
15. Verify that 4(29 !) + 5 ! is divisible by 31.
16. Define Euler’s phi function. (i) Prove that for 𝑛 > 2, 𝜑(𝑛) is an even integer.
17. If 𝜑(𝑛)|(𝑛 − 1), prove that n is a square free integer.
18. Calculate𝜙(360), 𝜙(1001), 𝜙(5040), 𝑎𝑛𝑑 𝜙(36,000)
19. 𝐼𝑓 𝑛 ≥ 1 𝑎𝑛𝑑 𝑔𝑐𝑑(𝑎, 𝑛) = 1, 𝑡ℎ𝑒𝑛 𝑎𝜙(𝑛) = 1 (𝑚𝑜𝑑 𝑛).
20. Use Euler's theorem to establish for any integer 𝑎,𝑎𝜙(𝑛) ≡ 1(𝑚𝑜𝑑9).
21. Establish each of the assertions below:
i) If n is an odd integer, then 𝜑(2n) = (n).
ii) If n is an even integer, then 𝜑(2𝑛)= 2 𝜑(𝑛).
iii) 𝜑 (3𝑛) = 3 𝜑(n) if and only if 3|𝑛.
iv) 𝜑 (3𝑛) = 2 𝜑(𝑛) if and only if 3 ∤ 𝑛.
𝑛
v) Show that 𝜑(𝑛) = 2, if and only if 𝑛 = 2𝑘 for 𝑘 ≥ 1.
1
vi) If p is a prime and k>0, then 𝜑(𝑝𝑘 ) = 𝑝𝑘 − 𝑝𝑘−1 = 𝑝𝑘 (1 − 𝑝).
vii) For n > 2, 𝜑(𝑛) is an even integer.
22. If 𝑛 ≥ 1, and 𝑔𝑐𝑑(𝑎, 𝑛) = 1, then 𝑎𝜑(𝑛) ≡ 1(𝑚𝑜𝑑𝑛).
23. Use Euler's theorem to establish the following:
i) For any integer 𝑎, 𝑎37 ≡ 𝑎 (𝑚𝑜𝑑 1729). [Hint: 1729 = 7 · 13 · 19.]
ii) For any integer 𝑎, 𝑎13 ≡ 𝑎 (𝑚𝑜𝑑 2730). [Hint: 2730 = 2 · 3 · 5 · 7 · 13.]
iii) For any odd integer 𝑎, 𝑎33 ≡ 𝑎 (𝑚𝑜𝑑 4080). [Hint: 4080 = 15 · 16 · 17.]
24. Prove that for any integer 𝑎 have order 𝑘 modulo 𝑛. Then 𝑎ℎ = 1 (𝑚𝑜𝑑 𝑛) if and
only if 𝑘|ℎ, in particular (𝑘|𝜑(𝑛)).
25. If the integer 𝑎 has order 𝑘 modulo 𝑛 and ℎ > 0, then 𝑎ℎ has order 𝑘/𝑔𝑐𝑑(ℎ, 𝑘)
modulo n.
26. If p is a prime and 𝑓(𝑥) = 𝑎𝑛 𝑥 𝑛 + 𝑎𝑛−1 𝑥 𝑛−1 + ⋯ + 𝑎1 𝑥 + 𝑎0 𝑎𝑛 ≠ 0(𝑚𝑜𝑑𝑝) is a
polynomial of degree 𝑛 ≥ 1 with integral coefficients, then prove that the congruence
𝑓(𝑥) = 0 (𝑚𝑜𝑑 𝑝) has at most n incongruent solutions modulo p.
27. Determine all the primitive roots of the primes p = 11, 19, and 23, expressing each as a
power of some one of the roots.
28. Given that 3 is a primitive root of 43, find the following:
(a) All positive integers less than 43 having order 6 modulo 43 .
(b) All positive integers less than 43 having order 21 modulo43
29. Find all positive integers less than 61 having order 4 modulo 61.
30. Solve the following quadratic congruences:
a) 𝑥 2 + 7𝑥 + 10 = 0 (𝑚𝑜𝑑 11).
b) 3𝑥 2 + 9𝑥 + 7 = 0 (𝑚𝑜𝑑 13).
c) 5𝑥 2 + 6𝑥 + 1 = 0(𝑚𝑜𝑑23).
31. Find the value of the following Legendre symbols:
a) (19/23).
b) (-23/59).
c) (20/31).
d) (18/43).
e) (-72/131)
32. Prove that if p is an odd prime, then Legendre symbol
1 1, 𝑖𝑓 𝑝 ≡ 1(𝑚𝑜𝑑4)
(− 𝑝) = { Hence show that there are infinitely many
−1, 𝑖𝑓 𝑝 ≡ 3(𝑚𝑜𝑑4).
primes of the form 𝑝 ≡ 1(𝑚𝑜𝑑4).
33. Given that 𝑎 is a quadratic residue of the odd prime p, prove that
i) 𝑎 is not a primitive root of p.
𝑝+ 1
ii) If 𝑝 = 3 (𝑚𝑜𝑑 4), then 𝑥 = ±𝑎 4 (𝑚𝑜𝑑 𝑝) are the solutions of the
congruence 𝑥 2 = 𝑎 (𝑚𝑜𝑑 𝑝).
34. Prove that if 𝑎 is a quadratic residue of odd prime p, then 𝑎 is not a primitive root of p.
35. If 𝑝 = 2𝑘 + 1 is prime, verify that every quadratic nonresidue of p is a primitive
root of p.
36. Prove that there are infinitely many primes of the form 4k+1.
 𝑝−1
𝑎
37. Show that if p is an odd prime then the Legendre symbol (𝑝) ≡ 𝑎 2 (𝑚𝑜𝑑 𝑝).
38. Let 𝑟 be a primitive root of the integer 𝑛. Prove that 𝑟 𝑘 is a primitive root of n if and
only if gcd(𝑘, 𝜑(𝑛)) = 1.
39. Find two primitive roots of 10.

Unit III
1. Encrypt the plaintext message GOLD MEDAL using the RSA algorithm with key
(2561, 3).
2. Encrypt the plaintext message NO WAY TODAY using the RSA algorithm with key
(2701,47).
3. Using linear cipher 𝐶 ≡ 5P + 11(𝑚𝑜𝑑26), encrypt the message NUMBER THEORY
IS EASY.
4. Use the Hill cipher
𝐶1 ≡ 5𝑃1 + 2𝑃2 (𝑚𝑜𝑑26)
𝐶2 ≡ 3𝑃1 + 4𝑃2 (𝑚𝑜𝑑26)
To encipher the message GIVE THEM TIME.
5. ciphertext ALXWU VADCOJO has been enciphered with the cipher
𝐶1 ≡ 4𝑃1 + 11𝑃2 (𝑚𝑜𝑑26)
𝐶2 ≡ 3𝑃1 + 8𝑃2 (𝑚𝑜𝑑26)
Derive the plaintext.
6. Encipher the message ATTACK AT ONCE using a Vigenère cipher with the keyword
READY.
7. Encipher the message HAVE A NICE TRIP using a Vigenère cipher with the keyword
MATH
8. Encrypt the plaintext message NO WAY TODAY using the RSA algorithm with key
(2701,47).
9. A person with public key (31, 2, 22) and private key k=17 wishes to sign a message
whose first plaintext block is B=14. If 13 is the integer chosen to construct the signature,
obtain the signature produced by the ElGamal algorithm.
10. Assume that a person has ElGamal public key (2633, 3, 1138) and private key k=965. If
the person selects random integer j=583 to encrypt the message BEWARE OF THEM,
obtain the resulting ciphertext.
11. Assume that a person has ElGamal public key (43, 3, 22) and private key k=15. If the
person selects random integer j=25 to encrypt the message SELL NOW, obtain the
resulting ciphertext.