IV SEMESTER MSc MATHEMATICS

Analytic Number Theory MCQ

1. Euler totient function, 𝜑(𝑛), 𝑛 ≥ 1

(a) takes only values 0,1 and −1.
(b) takes value 1 for prime numbers.
(c) is bounded.
(d) takes value 𝑝 − 1 for prime numbers.

2. Which of the following expression for Euler totient function, 𝜑(𝑛) is not true.
1
(a) 𝜑(𝑛) = ∏𝑝/𝑛 (1 − 𝑝)
𝑛
(b) 𝜑(𝑛) = ∑𝑑/𝑛 𝜇(𝑑) 𝑑
1
(c) 𝜑(𝑛) = ∑𝑛𝑘=1 [(𝑛,𝑘)]
𝑛
(d) 𝜑(𝑛) = ∑𝑑/𝑛 ∑𝑞=1
𝑑
𝜇(𝑑)

3. Which of the following arithmetic functions is not a multiplicative function.

(a) Power function, 𝑓𝛼 (𝑛) = 𝑛𝛼
1
(b) Identity function, 𝐼(𝑛) = [ ]
𝑛
(c) Dirishlet product 𝑓 ∗ 𝑔 of two multiplicative functions.
(d) Mangoldt function, 𝛬(𝑛)

4. For a multiplicative function 𝑓, 𝑓(1) equals,

(a) 1
(b) 0
(c) −1
(d) can be any value

5. Find the number of integers less than or equal to 100 which are relatively prime to
100.
(a) 20
(b) 40
(c) 40
(d) 60

6. Which arithmetic function is the dirichlet inverse of the Mobius function, 𝜇(𝑛)
(a) Euler totient function, 𝜑(𝑛)
(b) 𝑢(𝑛) = 1, for all 𝑛
1
(c) Identity function, 𝐼(𝑛) = [𝑛 ], for all 𝑛
(d) 𝑁(𝑛) = 𝑛, for all 𝑛

7. For the Mangoldt function 𝛬(10) equals

(a) 𝑙𝑜𝑔(10)
(b) 1
(c) 0
 (d) 𝑙𝑜𝑔(2)

8. Average order of divisor function, 𝑑(𝑛) is

(a) 𝑙𝑜𝑔(𝑛)
(b) 𝑛
𝑛2
(c) 2
(d) √𝑛

9. Value of 𝜁(2), where 𝜁 is Riemann zeta function

(a) 0
(b) 𝜋
𝜋2
(c)
6
6
(d) 𝜋2

10. Average order of divisor function, 𝜎𝛼 (𝑛), where 𝛼 = 1

𝜋2 𝑛
(a) 12
𝜋2 𝑛
(b) 6
(c) 𝑛𝑙𝑜𝑔(𝑛)
(d) 𝑙𝑜𝑔(𝑛)

11. Limit of density of lattice points visible from the origin is

(a) 𝑙𝑖𝑚 𝑙𝑜𝑔 𝑟, where r is the half of the length of the side of the square in plane
𝑟→∞
with centre at origin.
6
(b) 𝜋2
24 2
(c) 𝑟 + 𝑂(𝑟𝑙𝑜𝑔(𝑟)), where 𝑟 is as in option (a)
𝜋2
(d) 𝜋

12. Probability that two integers a and b chosen random are relatively prime is
(a) 𝑔𝑐𝑑(𝑎, 𝑏)
𝑎𝑏
(b) 𝑔𝑐𝑑(𝑎,𝑏)
(c) 𝜋
6
(d) 𝜋2

13. Average order of 𝜇(𝑛) is

(a) 1
(b) 0
(c) 𝑙𝑜𝑔 𝑛
(d) 𝑛𝑙𝑜𝑔 𝑛

14. Average order of 𝛬(𝑛) is

(a) 1
(b) 0
 (c) 𝑙𝑜𝑔 𝑛
(d) 𝑛𝑙𝑜𝑔 𝑛

15. Weight average of 𝜇(𝑛) is

(a) 1
(b) 0
(c) 𝑙𝑜𝑔 𝑛
(d) 𝑙𝑜𝑔 [𝑛]!

16. Weight average of 𝛬(𝑛) is

(a) 1
(b) 0
(c) 𝑙𝑜𝑔 𝑛
(d) 𝑙𝑜𝑔 [𝑛]!

17. Average order of 𝜑(𝑛) is,

𝜋2
(a) 6
(b) 𝑙𝑜𝑔 𝑛
3𝑛
(c) 𝜋2
(d) 𝑛𝑙𝑜𝑔 𝑛

18. Let 𝐹 denotes a real/complex valued function defined on positive real

axis(0, +∞): 𝐹(𝑥) = 0 for 0 < 𝑥 < 1 and 𝛼, 𝛽 be arithmetic functions. Let 𝛼 ∘ 𝐹 be
generalised convolution of 𝛼 & 𝐹 and ∗ be the dirichlet product. Then which of the
following is true.
(a) 𝛼 ∘ 𝛽 = 𝛽 ∘ 𝛼
(b) 𝛼 ∘ (𝛽 ∘ 𝐹) = (𝛼 ∗ 𝛽) ∘ 𝐹
(c) 𝛼 ∘ (𝛽 ∘ 𝐹) = (𝛼 ∘ 𝛽) ∘ 𝐹
(d) 𝛼 ∘ 𝐹 = 𝛼 ∗ 𝐹

19. Which of the following is not true

𝑥
(a) 𝑙𝑜𝑔 [𝑥]! = ∑𝑛≤𝑥 𝛬(𝑛)[𝑛]
𝑥
(b) 𝑙𝑜𝑔 [𝑥]! = ∑𝑝≤𝑥 𝛼(𝑝)𝑙𝑜𝑔 𝑝, 𝛼(𝑝) = ∑∞
𝑚=1 [ ]
𝑝𝑚
(c) 𝑙𝑜𝑔 [𝑥]! = 𝑙𝑜𝑔 𝑥 + 𝑂(𝑙𝑜𝑔 𝑥)
(d) 𝑙𝑜𝑔 [𝑥]! = 𝑥𝑙𝑜𝑔 𝑥 − 𝑥 + 𝑂(𝑙𝑜𝑔 𝑥)

20. For 𝑥 ≥ 1, 𝑠 > 1, 𝑂(𝑥 −𝑠 ) is

(a) 𝑂(𝑥 𝑠−1 )
(b) 𝑂(𝑥 𝑠+1 )
(c) 𝑂(𝑥1−𝑠 )
(d) 𝑂(𝑥 2𝑠 )

21. If 𝑥 ≥ 1, 𝛼 > 0, 𝑂(𝑥 𝛼 ) + 𝑂(𝑥) = 𝑂(𝑥 𝛽 ), then

(a) 𝛽 = 𝑚𝑎𝑥{1, 𝛼}
(b) 𝛽 = 𝑚𝑖𝑛{1, 𝛼}
 (c) 𝛽 = 1
(d) 𝛽 = 𝛼

22. Which of the following sum represents the number of lattice points in a 𝑞𝑑 − plane
that lie on the hyperbola, 𝑞𝑑 = 𝑛, 𝑛 = 1,2, . . . , [𝑥]
(a) ∑𝑛≤𝑥 𝜇(𝑛), where 𝜇 is the Mobius function
(b) ∑𝑛≤𝑥 𝛬(𝑛). where 𝛬 is the Mangoldt function
(c) ∑𝑛≤𝑥 𝜑(𝑛), where 𝜑 is the Euler totient function
(d) ∑𝑛≤𝑥 𝑑(𝑛), where d is the divisor function.

23. Let f be a completely multiplicative function. then which of the following is the
Dirichlet inverse of f
(a) 𝑓 −1 (𝑛) = 𝜑(𝑛)𝑓(𝑛), where 𝜑 is the Euler totient function
(b) 𝑓 −1 (𝑛) = 𝜇(𝑛)𝑓(𝑛), where 𝜇 is the Mobius function
(c) 𝑓 −1 (𝑛) = 𝛬(𝑛)𝑓(𝑛), where 𝛬 is the Mangoldt function
(d) 𝑓 −1 (𝑛) = 𝑢(𝑛)𝑓(𝑛), where 𝑢 is the unit function

24. What is the identity element in the abelian group of all arithmetical functions f with
𝑓(1) ≠ 0 under the operation Dirichlet product
(a) f(n)=n, for all n
(b) f(n)=1, for all n
1
(c) f(n)=[𝑛], for all n, where [𝑥], is the greater inter less than or equal to x.
(d) f(n)= 0 , for all n

1
25. If 𝐼(𝑛) = [𝑛], then for all n, the value of 𝐼(𝑛)𝑙𝑜𝑔(𝑛) equals
(a) I(n)
(b) 1
(c) 0
(d) log(n)

𝜗(𝑥)
26. lim is
𝑥→∞ 𝑥
(a) 0 (b) 1 (c) ∞ (d) e
27. The correct order of magnitude of 𝜋(𝑛) is
𝑛 log 𝑛
(a) (b) n log n (c) (d) log n
log 𝑛 𝑛
28. Theorems relating to different weighted averages of same functions are called
(a) Prime number theorem (b) Abel’s identity (c) Tauberian theorem (d) None of
these
log 𝑝
29. ∑𝑝≤𝑥 is
𝑝
(a) log x + O(1) (b) x log x + O(x) (c) x log x + O(1) (d) x log x- x + O (log
x)
𝜓(𝑥) 𝜗(𝑥)
30. lim ( 𝑥
− 𝑥
) is
𝑥→∞
(log 𝑥)2
(a) 1 (b) (c) 0 (d) None of these
2√𝑥 log 2
 𝑥
31. The relation ∑𝑦<𝑛≤𝑥 𝑎(𝑛)𝑓(𝑛) = 𝐴(𝑥)𝑓(𝑥) − 𝐴(𝑦)𝑓(𝑦) − ∫𝑦 𝐴(𝑡)𝑓 ′ (𝑡) 𝑑𝑡 where a(n) is
an arithmetical function with 𝐴(𝑥) = ∑𝑛≤𝑥 𝑎(𝑛) is known as
(a) Euler summation formula (b) Abel’s identity (c) Prime number theorem (d) None of
these
32. 𝜓(𝑥) is equivalent to which of the following
log 𝑥
(a) ∑𝑝≤𝑥 log 𝑝 (b) lim (c) ∑𝑛≤𝑥 𝑎(𝑛) (d) ∑𝑛≤𝑥 ⋀(𝑛)
𝑛→∞ 𝑥
33. 𝜗(𝑥) is equivalent to which of the following .
log 𝑥
(a) ∑𝑝≤𝑥 log 𝑝 (b) lim (c) ∑𝑛≤𝑥 𝑎(𝑛) (d) ∑𝑛≤𝑥 ⋀(𝑛)
𝑛→∞ 𝑥
𝜋(𝑥) log 𝑥
34. The relation lim = 1 is known as
𝑥→∞ 𝑥
(a) Prime number theorem (b) Abel’s identity (c) Tauberian theorem (d) None of
these
𝑥 𝜋(𝑡)
35. 𝜋(𝑥) log 𝑥 − ∫2 𝑑𝑡 = ----------
𝑡
𝑃𝑛
(a) 𝜋(𝑥) (b) 𝜓(𝑥) (c) 𝜗(𝑥) (d) 𝑛
𝜗(𝑥) 𝑥 𝜗(𝑡)
36. + ∫2 𝑙𝑜𝑔2 𝑡 𝑑𝑡 = ------------
log 𝑥
𝑃𝑛
(a) 𝜋(𝑥) (b) 𝜓(𝑥) (c) 𝜗(𝑥) (d) 𝑛
37. Which of the following is not the equivalent form of prime number theorem
𝜋(𝑥) log 𝑥 𝜗(𝑥) 𝜓(𝑥) 𝑃𝑛
(a) lim =1 (b) lim = 1 (c) lim = 1 (d) lim =1
𝑥→∞ 𝑥 𝑥→∞ 𝑥 𝑥→∞ 𝑥 𝑛→∞ 𝑛
∧(𝑛)
38. ∑𝑛≤𝑥 = ---------------
𝑛
(a) x log x + O(1) (b) log x + O(1) (c) x log x + O(x) (d) log x + O(x)
log 𝑝
39. ∑𝑝≤𝑥 = ------------
𝑝
(a) log x + O(1) (b) log x + O(x) (c) x log x + O(1) (d) x log x + O(x)
𝑥
40. ∑𝑛≤𝑥 𝜓( ) = ---------------
𝑛
(a) x log x – x + O( log x) (b) x log x + O (x) (c) x log x + O( log x) (d) None of these
𝑥
41 . ∑𝑛≤𝑥 𝜗(𝑛 ) = -----------------------
(a) x log x + O( 1) (b) x log x + O (x) (c) x log x + O( log x) (d) None of these
1
42. The relation log log 𝑥 + 𝐴 + 𝑂( ) is equivalent to which of the following where A is
log 𝑥
a constant and 𝑥 ≥ 2
log 𝑝 ∧(𝑛) 1 𝑥
(a) ∑𝑝≤𝑥 (b) ∑𝑛≤𝑥 ∑𝑝≤𝑥 ( d) ∑𝑛≤𝑥 𝜓( )
𝑝 𝑛 𝑝 𝑛
43. Which of the following is the lower bound for the n ‘th prime 𝑝𝑛
1 𝑛 𝑛 1 12
(a) 6 log 𝑛 (b) 6 log 𝑛 (c) 6 𝑛 log 𝑛 (d) 12 ( 𝑛 log 𝑛 + 𝑛 log 𝑒
)
44. Which of the following is the upper bound for the n ‘th prime 𝑝𝑛
1 𝑛 𝑛 1 12
(a) 6 log 𝑛 (b) 6 log 𝑛 (c) 𝑛 log 𝑛 (d) 12 ( 𝑛 log 𝑛 + 𝑛 log )
6 𝑒
45. The theorem stating (𝑝 − 1)! ≡ −1 (𝑚𝑜𝑑 𝑝) is known as
(a) Lagranges theorem (b) Little Fermat theorem (c) Wilson’s theorem (d)
Wolstenholmes theorem
46. The value of Fermat number 𝐹3 is
(a)17 (b) 154 (c) 235 (d)257
47. Number of solutions of linear congruence 𝑎𝑥 ≡ 𝑏 ( 𝑚𝑜𝑑 𝑚) for (a, m)=1 is
(a) 0 (b)1 (c) 2 (d) 3
48. The value of congruence satisfying the congruence 3x ≡ 2 (mod5)
(a) 2 (b)1 (c)4
(d)3

49.The unit digit of 72022 is

(a) 1 (b) 2 (c) 7 (d) 9

50. If X= 48 , Y=15 then the value of k such that X(modY ) ≡(X+KY ) mod Y
(a) No such k exists
(b) k is any positive integer
(c) k is any negative integer
(d) k is any integer

51. What is the value of 96 (mod7)

(a) 7 (b) 3 (c)5 (d) 1

52. What is the remainder when 220+330+440+550+117 is divided by 7

(a) 2450 (b) 36 (c) 0 (d) 3

53.If p is an odd prime number then according to Fermats theorem

(a) 2P-1 - 2 is divisible by p
(b) 2P-1 -1 is divisible by p
(c) 2P - 2 is not divisible by p
(d) 2P – 2 is divisible by p
54. The general solution of x ≡ 5(mod 25) and x≡ 32 ( mod 23)
(a) 800+55k for k ԑ z
(b) 55-800k for k ԑ z
(c) 55+575k for k ԑ z
(d) 800-55k for k ԑ z

55. Solution of the following congruence using Chinese Remainder

theorem is x≡ 3 mod(9), x≡ 7 mod(13)
(a) x≡107 (mod117)
(b ) x≡103 (mod117)
(c) x≡111 (mod117)
(d) x≡105 ( mod 117)

56. Let k be the order of a mod(n) then ab≡1 mod(n)

(a) k divides a
(b) k divides b
(c) k divides n
(d) k divides 1

57. The value of x using Chinese remainder theorem if

x≡2(mod3),x≡2(mod4),x≡1(mod5) is a simultaneous system of linear
congruences
(a) 60 (b) 146 (c) 47 (d) 256
58. If a and b are any positive integers and a≡b (mod n) then
(a) gcd(a,n) = gcd(b,n)
(b) b divides a-n
(c) f(x)≡1 mod(n)
(d) a and b leave different nonnegative remainder when divided by n
59. The the remainder when 331 is divided by 7 is
(a) 5 (b) 16 (c) 18 (d) 3

60. Which one of the following is correct

(a) 28≡10(mod 6)
(b) 4≡7(mod 3)
(c) 17≡13(mod5)
(d) 8≡13(mod2)

61. Let a,b,c and n are integers ten which of the following is correct
(a) a≡ a(modn)
(b) a≡ b(modn) then b≡ a(modn)
(c) a≡ b(modn) then b≡ c (modn) then a≡ c(modn)
(d) All the above

62. Let a≡ b(modn) and c≡ d(modn) then which of the following is

incorrecct
(a) a+c≡ b+d (modn)
(b) a-c≡ b-d (modn)
(c) ac≡bd(modn)
(d) 𝑎𝑐≡𝑏𝑑mod(n)
63. The remainder when 4160 is divided by 7 is
(a) 2 (b) 1 (c)3 (d) 4
64. If a≡b (mod n1) and a≡ b(mod n2) iff a≡ b(mod n) then
(a) n= gcd (n1, n2)
(b) n=lcm (n1, n2)
 (c) n= gcd (a, b)
(d) n= lcm (a,b)

65. Number of incongruent solutions of 35x≡14 (mod21) is

(a) 7 (b) 6 (c) 5 (d) 0

66. Which of the following has a unique incongruent solutions

(a) 8x≡14(mod24)
(b) 20x≡14(mod15)
(c) 12x≡14(mod2)
(d) 15x≡14(mod8)

67.5x≡2(mod3) then
(a) x≡2(mod3)
(b) x≡1 (mod3)
(c) x≡2 (mod2)
(d) x≡1 (mod2)

68. The system of linear congruences ax+by≡ r(modn) and cx+dy≡s(modn)

has a unique solution modulo n if
(a) gcd(ad-bc,n) =1
(b) gcd(ad+bc, n) =1
(c) gcd(ab+cd,n) =1
(d) gcd(ab-cd,n) =1

69.If ac≡ bc(mod n) and if gcd(n,c)=d then

(a) a≡b mod(𝑛𝑑)
(b)𝑎𝑑≡𝑏𝑑(modn)
(c) a≡ b( mod n)
(d) None of the above

70.Which of the following is reduced residue system modulo 5

(a) {1,2,3,4}
(b){5,7,8,10}
(c) {2,10,25,7}
(d) None of the above

71.The number of solutions of x2≡ 1(mod 8) is

 (a) 1
(b) 2
(c) 0
(d) 4

72. Solution of 5x≡3(mod24) is

(a) 14(mod24)
(b) 15(mod24)
(c) 8 (mod24)
(d) 10(mo24)

73. Solutions of 𝑥 2 ≡ 4 (𝑚𝑜𝑑7) are

a) 2 & 5
b) 2 &6
c) 1 & 2
d) 2 & 4
74. Solutions of 𝑥 2 ≡ 3 (𝑚𝑜𝑑11) are
a) 1 & 3
b) 5 &6
c) 2 & 3
d) No solution

75. The Congruence 𝑥 2 ≡ 𝑛 (𝑚𝑜𝑑 𝑝) represents

a) 𝑛𝑅̅𝑝
b) n is a quadratic non residue mod p
c) n is a quadratic residue mod p
d) None of these
76. Which of the following are equivalent
i. 𝑥 2 is not congruent to n mod p
ii. 𝑛𝑅̅𝑝
iii. n is a quadratic residue mod p
iv. n is a quadratic non residue mod p

a) (i), (ii) & (iv)

b) (i), (iii) & (iv)
c) (ii) & (iii)
d) (i) & (iii)
77. Quadratic residues mod 11 are
a) 2, 6, 7, 8, 10
b) 1, 3, 4, 5, 9
c) 1, 2, 3, 4, 5
d) 6, 7, 8, 9, 10
78. Quadratic non residues mod 11 are
a) 2, 6, 7, 8, 10
b) 1, 3, 4, 5, 9
c) 1, 2, 3, 4, 5
d) 6, 7, 8, 9, 10
79. Quadratic residues mod 13 are
a) 1, 3, 4, 9, 10, 12
b) 2, 5, 6, 7, 8, 11
c) 1, 2, 3, 4, 5, 6
d) 6, 7, 8, 9, 10, 11
80. Quadratic non residues mod 13 are
a) 1, 3, 4, 9, 10, 12
b) 2, 5, 6, 7, 8, 11
c) 1, 2, 3, 4, 5, 6
d) 6, 7, 8, 9, 10, 11
81. The Legendre’s symbol (n|p) = …………
1 𝑖𝑓 𝑛𝑅𝑝
a) {
−1 𝑖𝑓 𝑛𝑅̅𝑝
−1 𝑖𝑓 𝑛𝑅𝑝
b) {
1 𝑖𝑓 𝑛𝑅̅ 𝑝
1 𝑖𝑓 𝑛𝑅𝑝
c) {
0 𝑖𝑓 𝑛𝑅̅𝑝
d) None of the above

82. The Legendre’s symbol (n|p) = …… if 𝑛 ≡ 𝑜 (𝑚𝑜𝑑 𝑝)

a) 0
b) 1
c) -1
d) None of the above
83. The Legendre’s symbol (1|p) = ………….
a) 0
b) (−1)𝑝
c) −1
d) 1

84. The Legendre’s symbol (𝑚2 |p) = ………….

a) 0
b) (−1)𝑝
c) −1
d) 1
85. Which of the following equation represents Euler’s criterion.
a) (n|p) ≡ 𝑛𝑝−1 (𝑚𝑜𝑑 𝑝)
𝑝−1
b) (n|p) ≡ 𝑛 2 (𝑚𝑜𝑑 𝑝)
𝑝
c) (n|p) ≡ 𝑛 (𝑚𝑜𝑑 𝑝)
2
𝑝+1
d) (n|p) ≡ 𝑛 2 (𝑚𝑜𝑑 𝑝)
86. Which of the following is not true about Legendre’s symbol (n|p)
a) Completely multiplicative
b) Doesn’t vanish when p divides n
c) Periodic with period p and vanish when p divides n
d) It is the quadratic character mod p

87. By Gauss’ Lemma, we have the relation (n|p) = (−1)𝑚 , where n is not congruent to 0
mod p and m is
(𝑝−1) 𝑝
a) Number of least positive residues mod p in {n, 2n, 3n, …, n} which exceed 2
2
(𝑝−1) 𝑝
b) Number of residues mod p in {n, 2n, 3n, …, n} which exceed 2
2
(𝑝−1) 𝑝
c) Number of least positive residues mod p in {n, 2n, 3n, …, n} which does not exceed 2
2
d) None of the above

88. For every odd prime (-1|p) = ……… if 𝑝 ≡ 1 (𝑚𝑜𝑑 4).

a) 1
b) -1
c) 0
d) None of the above

89. For every odd prime (-1|p) = ……… if 𝑝 ≡ 3 (𝑚𝑜𝑑 4).

a) 1
b) -1
c) 0
d) None of the above

90. For every odd prime (2|p) = ……… if 𝑝 ≡ ±1 (𝑚𝑜𝑑 8).

a) 1
b) -1
c) 0
d) None of the above

91. For every odd prime (2|p) = ……… if 𝑝 ≡ ±3 (𝑚𝑜𝑑 8).

a) 1
b) -1
c) 0
d) None of the above
92. If p and q are distinct odd primes then which of the following represents quadratic
reciprocity law
(𝑝+𝑞)(𝑞−1)
a) (𝑝|𝑞)(𝑞|𝑝) = (−1) 4

−(𝑞|𝑝) 𝑖𝑓 𝑝 ≡ 𝑞 ≡ 3(𝑚𝑜𝑑 4)
b) (𝑝|𝑞) = {
(𝑞|𝑝) 𝑖𝑓 𝑝 ≡ 𝑞 ≡ 1(𝑚𝑜𝑑 4)
(𝑞|𝑝) 𝑖𝑓 𝑝 ≡ 𝑞 ≡ 3(𝑚𝑜𝑑 4)
c) (𝑝|𝑞) = {
−(𝑞|𝑝) 𝑖𝑓 𝑝 ≡ 𝑞 ≡ 1(𝑚𝑜𝑑 4)
d) None of the above

93. The exponent of 𝑎 𝑚𝑜𝑑𝑢𝑙𝑜 𝑚 is …………………

a. the smallest positive integer f such that 𝑎 𝑓 ≡ 1(𝑚𝑜𝑑 𝑚)
b . the smallest integer f such that 𝑎 𝑓 ≡ 1(𝑚𝑜𝑑 𝑚)
c. the greatest integer f such that 𝑎 𝑓 ≡ 1(𝑚𝑜𝑑 𝑚)
d. None of the above
94. Let 𝑚 ≥ 1 and (𝑎, 𝑚) = 1 𝑎𝑛𝑑 𝑓 = 𝑒𝑥𝑝𝑚 (𝑎). Then which of the following is not true.
a. the numbers 1, 𝑎, 𝑎 2 , … , 𝑎 𝑓−1 are incongruent modulo m.
b. the numbers 1, 𝑎, 𝑎 2 , … , 𝑎 𝑓−1 are congruent modulo m.
c. 𝑎 𝑓 ≡ 1(𝑚𝑜𝑑 𝑚)
d. 𝑎, 𝑎 2 , … , 𝑎 𝑓 are incongruent modulo m.

95. Which of the following is not a complete residue system for mod m.
a. {0,1,2,3, … , 𝑚 − 1}
b. {1,2,3, … , 𝑚}
c. {𝑚 + 1, 𝑚 + 2, … ,2𝑚}
d. {𝑚 + 1, 𝑚 + 2, … ,2𝑚 − 1}
96. Which of the following is not true.
a. ∅(𝑚) ≤ 𝑒𝑥𝑝𝑚 (𝑎)
b. 𝑒𝑥𝑝𝑚 (𝑎) ≤ ∅(𝑚)
c. 𝑒𝑥𝑝𝑚 (𝑎)| ∅(𝑚)
d. None of the above
97. Primitive root for 𝑚 = 1 is
a. 1
b. 0
c. 2
d. No primitive root
98. Primitive root for 𝑚 = 2 is
a. 1
b. 2
c. 3
d. 4
∅(2𝛼 ) 𝛼
99.Let x be an odd integer and 𝛼 ≥ 3. Then 𝑥 2 ≡1 (𝑚𝑜𝑑 2 ) represents
a. there exists primitive roots 𝑚𝑜𝑑 2𝛼
b. there exist no primitive roots 𝑚𝑜𝑑 2𝛼
c. there exist no primitive roots 𝑚𝑜𝑑 2𝑝 𝛼 , where p is a prime
d. None of the above
100. If g is a primitive root mod p, where p is an odd prime, then ………………………….
a. 𝑔2 , 𝑔4 , … . , 𝑔𝑝−1 are the quadratic residues mod p
b. 𝑔2 , 𝑔4 , … . , 𝑔𝑝−1 are the quadratic non residues mod p
c. 𝑔, 𝑔3 , … . , 𝑔𝑝−2 are the quadratic residues mod p
d. None of the above.
IV SEMESTER MSc MATHEMATICS
ANALYTIC NUMBER THEORY MCQ ANSWER KEY
1. d
2. a
3. d
4. a
5. b
6. b
7. c
8. a
9. c
10. a
11. b
12. d
13. b
14. a
15. a
16. d
17. c
18. b
19. c
20. c
21. a
22. d
23. b
24. c
25. c
26. b
27. a
28. c
29. a
30. c
31. b
32. d
33. a
34. a
35. c
36. a
37. d
38. b
39. a
40. a
41. b
42. c
43. c
44. d
45.c
46. d
47. b
48. d
49. d
50. d
51.d
52. c
53.d
54. c
55. c
56.b
57.b
58. a
59. d
60. d
61. d
62. d
63. b
64.b
65.a
66.d
67.b
68. a
69. a
70. a
71. d
72. b
73.a
74. b
75.c
76. a
77.b
78.a
79. a
80. b
81. a
82. a
83. d
84.d
85.b
86.b
87. a
88.a
89.b
90.a
91.b
92. b
93.a
 94. b
95. d
96. a
97. a
98. c
99. b
100. a