Question Bank On Number theory

Unit 1

Notations used

ℕ≔Set of Natral Numbers 𝑎|𝑏 ∶= 𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏

ℚ≔Set of rational Numbers 𝜙(𝑛) ≔Euler totient function or Euler phi

function
ℤ≔Set of Integers
𝜏(𝑛) ≔number of positive divisors of 𝑛
ℂ≔Set of Complex Numbers
𝜎(𝑛) ≔sum of positive divisors of 𝑛.
ℝ=set of real Numbers

Page 1 of 4
Modular Arithmetic & Divisibility & Euclid’s Algorithm:

1. Evaluate
a. −17𝑚𝑜𝑑2 b. −221𝑚𝑜𝑑 23 c. 199 𝑚𝑜𝑑 19
2. If 7 ≡ 2 (𝑚𝑜𝑑5) and 11 ≡ 1 (𝑚𝑜𝑑 5) then find 18 (mod5) and 77(mod5).
3. Find the least positive integer & the greatest negative integer to which 514 congruent
modulo 37.
4. Find the least positive integer modulo 7 to which the integer 22, 312 and (22 ∙ 312) are
congruent.
5. For 𝑥 ∈ ℤ, show that 𝑥 2 ≡ 0 𝑜𝑟 1 (𝑚𝑜𝑑 4).
6. For 𝑥 ∈ ℤ show that 𝑥 2 ≡ 0 , 1 𝑜𝑟 4 (𝑚𝑜𝑑 8)
7. For 𝑥 ∈ ℤ show that 𝑥 3 ≡ 0 ,1 𝑜𝑟 8 (𝑚𝑜𝑑 9)
8. For 𝑥 ∈ ℤ show that 𝑥 3 ≡ 0 , 1 𝑜𝑟 6 (𝑚𝑜𝑑 7).
9. For 𝑥 ∈ ℤ show that 𝑥 4 ≡ 0 𝑜𝑟 1 (𝑚𝑜𝑑 5)
10.If 𝑎 is an integer not divisible by 2 or 3, then show that 𝑎2 ≡ 1 𝑚𝑜𝑑 24.
11. If 𝑎 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 then 𝑎2 ≡ 1 (mod 8)
12. Show that 41|(220 − 1).
13. Show that 89|244 − 1.
14. Show that 97|248 − 1.
15. Find the smallest positive integer modulo 8, to which 32 ∙ 33 ∙ 34 ∙ 310 is congruent.
16. Find the smallest positive integer modulo 7 to which 25, 36, 213 and the product 25 ∙
36 ∙ 213 is congruent .
17. Find the smallest positive integer modulo 11 to which the product
2 ∙ 5 ∙ 7 ∙ 13 ∙ 21 ∙ 218 ∙ 417 is congruent.
18. Find the smallest positive integer modulo 5, to which 32 ∙ 33 ∙ 34 ∙ 310 is congruent.
19. Find the smallest positive integer to which 10515 is congruent modulo 7.
20. Find the smallest positive integer to which 10516 is congruent modulo 7.
21. Show that 22225555 + 55552222 is divisible 7.
22. Prove that integer 53103 + 10353 is divisible by 39.
23. Prove that111333 + 333111 is divisible by 7.
24. Find the smallest positive integer,
(i) which leaves remainder 1 when divided by 2,3,4,5 6 ,7,8 and 9.
(ii) Which leave s remainder 2 when divided by 3, 5,7 and 9.
(iii) Which leaves remainder 3 when divided by 2,4,5 and 7.
25. Find the last digit of 7313.
26. Find the last two digits of 13516.
27. .Find the last digit of 7313 + 13516 .

Page 2 of 4
 28. Find the remainder obtained upon dividing the sum
1! + 2! + 3! + ⋯ + 99! + 100! by 12.
29. What is the remainder when the following sum is divided by 4?
15 + 25 + 35 + ⋯ + 995 + 1005
30. Find the remainder when 250 and 4165 are divided by 7
31. Prove that , a positive integer is divisible by 9 , if the sum of its number is divisible by 9.
32. Using that , every integer 𝑎 of 𝑛 digits can be written as
𝑎 = 𝑎𝑛 10𝑛 + 𝑎𝑛−1 10𝑛−1 + ⋯ + 𝑎1 10 + 𝑎0 , where 𝑎𝑖′ 𝑠 are integers from 0 to 0,𝑎𝑛 ≠ 0,
Prove the following:-
(i) 𝑎 is divisible by 3 , if the sum of its digits is divisible by 3.
(ii) 𝑎 is divisible by 2 , if its last digit is divisible by 2.
(iii)𝑎 is divisible by 4 , if its last two digits are divisible by 4.
(iv) 𝑎 is divisible by 25 , if its last two digits are divisible by 25.
33. Show that ever four digit integer of the type 𝑎𝑏𝑏𝑎, is divisible by 11.
34. Show that , a six digit integer of the type 𝑎𝑏𝑐𝑎𝑏𝑐 is divisible by 7, 11,13 and hence by
1001.
35. Let 𝑥 & 𝑦 be integers.Prove that 2𝑥 + 3𝑦 is divisible by 17 iff 9𝑥 + 5𝑦 is divisible 17.
36. Let 𝑛 and 𝑑 be positive integers. How many positive integers not exceeding 𝑛 are
divisible by 𝑑?
37. Using Euclid algorithm, Find
(i) gcd(120,500) , (vi) gcd(7469,2464)
(ii) gcd(−306,657), (vii) gcd(2689,4001)
(iii) gcd(143,227) (viii) gcd(2947,3997)
(iv) gcd(252;198) (ix) gcd(1109,4999)
(v) gcd(272, 1479)
38. Using Eucild’s Algorithm find 𝑥and y satisfying the following. Moreover Show
that x and y are not unique integers.
(i) gcd(56,72)=56𝑥+72y
(ii) gcd(24,138)=24𝑥 + 138𝑦
(iii) gcd(119,272)=119𝑥 + 272𝑦
(iv) gcd(1769,2378)=1769𝑥 + 2378𝑦
(v) gcd(392,182)=392𝑥 + 182𝑦

*39 Find 𝑥, 𝑦 and z such that gcd(198,288,512) = 198𝑥 + 288𝑦 + 512𝑧.

40 Let 𝑥 & 𝑦 be integers.Prove that 2𝑥 + 3𝑦 is divisible by 17 iff 9𝑥 + 5𝑦 is divisible 17.

*41. Find all positive integers 𝑑 such that 𝑑 divides both 𝑛2 + 1 & (𝑛 + 1)2 + 1 for some
integer 𝑛.
21𝑛+4
*42. Prove that the fraction is irreducible for every positive integer 𝑛.
14𝑛+3

Page 3 of 4
 𝑛
*43. For all positive integers 𝑛, Let 𝑇𝑛 = 22 + 1. Show that if 𝑚 ≠ 𝑛 then 𝑇𝑚 and 𝑇𝑛
are relatively prime.

Prime Numbers and Seive of Eratosthenes &Testing for Prime Number:

1. Prove that √2 is irrational number.( using number theoretical approach).

2. Find the prime factors of 100, 641, 999 , 1024 and 7007.
3. Find the prime factors of 10!
4. How many number of zeros are there in 100!.
5. Find 𝜙(360), 𝜙(1001), 𝜙(5040).
6. Find 𝜏(10), 𝜏(35).
7. Find 𝜎(15), 𝜎(20).
8. Find
(i) lcm(23 35 72 , 24 33 )
(ii) gcd(17, 1717 )
(iii) gcd(2 ∙ 3 ∙ 5 ∙ 7 ∙ 11 ∙ 13 , 211 ∙ 39 ∙ 11 ∙ 1714 )
(iv) gcd(𝑝, 0), 𝑝 ∈ ℤ
(v) gcd(2331 , 2317 )
(vi) gcd(313 ∙ 517 , 212 ∙ 721 )
9. If 𝑥 and 𝑦 are odd then show that 𝑥 2 + 𝑦 2 cannot be a perfect square.
10. If p is a prime and 𝑝| (𝑎2 + 𝑏2 ) & 𝑝|𝑏2 + 𝑐 2 then show that
a. 𝑝| (𝑎2 − 𝑐 2 ).
b. 𝑝|(𝑎2 + 𝑐 2 ).
11.Determine which of the following is a prime( Mersenne’s)
a. 27 − 1 c. 29 − 1
b. 211 − 1 d. 213 − 1
12.A number is said to be perfect if it equals the sum of the square of its positive divisors
other than itself. Eg 6 & 28
Show that 2𝑝−1 (2𝑝 − 1) is perfect number when 2𝑝 − 1 is prime.
13.Find an integer 𝑛 such that 𝑛/2 is a square, 𝑛/3 is a cube and 𝑛/5 is a fifth power.
14.Given that gcd(𝑎, 𝑝2 ) = 𝑝 and gcd(𝑏, 𝑝3 ) = 𝑝2 , 𝑝 𝑖𝑠 𝑝𝑟𝑖𝑚𝑒. Evaluate gcd(𝑎𝑏, 𝑝4 ) and
gcd(𝑎 + 𝑏, 𝑝4 ).
15.Using Sieve of Eratosthenes find the prime numbers upto 80.
16.Using Sieve of Eratosthenes find the prime numbers upto 210.
17.Using Sieve of Eratosthenes find all the prime numbers between 100 to 200.
18.Show that 101 is prime.
19.Verify the statement 𝑝 𝑖𝑠 𝑝𝑟𝑖𝑚𝑒 ⟺ (𝑝 − 1)! ≡ −1𝑚𝑜𝑑𝑝 for 𝑝 = 7,11, 13
20.State Prime Number theorem.(no proof).

Page 4 of 4