Number Theory MCQs

Multiple Choice Questions
Number Theory BS Mathematics 2017-2021

MATH3118 Created by Z and N
Lecture 1
1. ℚ is the set of rational numbers of the form m/n such that
(a)m, n ∈ ℤ, n ≠ 0 (b)m, n ∈ 𝕎, n ≠ 0
(c)m, n ∈ ℤ, n = 0 (d)m, n ∈ ℕ, n ≠ 0
2. For a real number x, |x| denotes the absolute value of x such that
(a)|x| = x if x ≥ 0 (b)|x| = -x if x < 0
(c)|x| = x if x ≤ 0 (d)Both a and b
3. The number of elements in a set S is denoted by
(a)# S (b)S #
(c)* S (d)S *
4. The real part and imaginary parts of S are denoted by
(a)Re(S);Im(S) (b)Real(S);Imaginary(S)
(c)R(S);I(S) (d)Rea(S);Imag(S)
5. Both addition and multiplication in ℤ are _________.
(a)Commutative (b)Associative
(c)Distributive (d)All of these
6. If 𝑎 = 𝑞𝑏 for some integers q and 𝑎, 𝑏 ≠ 0 then we say that
(a)b divides a (b)b is a factor of a
(c)a is a multiple of b (d)All of these
7. If b ≠ 0 ∈ ℤ ,then which statement is correct?
(a)b|0 (b)b∤0
(c)0|b (d)None of these
8. For any integer a ∈ ℤ, mark the correct statement.
(a)a|1 (b)1|a
(c)0|a (d)None of these
Proposition:
i. If a| b and b| c, then a| c.
ii. If a| b and c| d, then ac| bd.
iii. If m ≠ 0 ∈ ℤ, then a| b iff ma| mb.
iv. If d ≠ 0 ∈ ℤ s.t. d| a and a ≠ 0, then |d| ≤ |a|
v. If a| x and a| y, then a| (cx + dy) for any integers c, d.
1|Page
vi. a| b and b| a iff a = ±b.
9. If S is a non-empty set of non-empty integers, then S has a least element c ∈ S, s.t.
(a)c ≤ x, ∀ x ∈ S (b)c < x, ∀ x ∈ S
(c)x ≤ c, ∀ x ∈ S (d)None of the above
10. By Principle of Induction, a set S of positive integers s.t. 1∈ S and k∈ S k+1∈ S, then
(a)S = 𝕎 (b)S = ℕ
(c)S = ℚ (d)S = ℤ
11. Which one of the following holds for all n∈ ℕ ?
(a)3𝑛+1 < 2𝑛 + 2 (b)3𝑛 < 2𝑛 + 1
(c)𝟑𝒏 ≥ 𝟐𝒏 + 𝟏 (d)3𝑛 > 2𝑛 + 1
12. If a, b∈ ℤ and b≠ 0, then ∃ a unique pair of integers q and r, s.t. a = bq + r where ______.
(a)0 ≤ r ≤ |b| (b)0 ≤ r < |b|
(c)0 > r > |b| (d)0 ≤ r ≤ b
13. If n, k∈ ℤ s.t. n is the square of an odd integer, then perfect square must be of the form ______.
(a)8k + 1 (b)7k + 1
(c)6k + 1 (d)9k + 1
Lecture 2
1. Any _______ has a unique decimal expansion.
(a)Integer (b)Positive Integer
(c)Real number (d)Negative Integer
2. Which one can be written as a linear combination of any 2 integers involved?
(a)GCD (b)Decimal expansion
(c)LCM (d)None of these
3. Any positive integer n can be written uniquely as 𝑛 = 𝑐𝑘 . 𝑏 𝑘 + 𝑐𝑘−1 . 𝑏 𝑘−1 + ⋯ + 𝑐1 . 𝑏 + 𝑐0 , if

we’ve the following conditions satisfied
(a)b > 1 (b)0 ≤ ci < b
(c)ck ≠ 0 (d)All of these
4. If a and b are two integers, then ∃ some integers x and y such that
(a) gcd(a, b) = ax + by (b) gcd(a, b) = ax – by
2|Page
(c) gcd(a, b) = axn + byn (d) gcd(a, b) = (ax + by)n
5. Which one of the statements is equal to 8?
(a) gcd(1, 8) (b) gcd(-32, 44)
(c) gcd(12, 42) (d) gcd(-32, 96)
6. The greatest common divisor of 2 integers a and b is the unique positive integer d if
(a)d | a (b)d | b
(c)If c | a ∧ c | b then c ≤ d (d)All of these
7. If c | a, c | b and d = gcd(a, b)
(a)c ≤ d (b)c | d
(c)Both a and b (d)None of these
Lecture 3
1. An efficient way of obtaining the gcd is known as ________.
(a)Well ordering principle (b)Division Algorithm
(c)Euclid’s Algorithm (d)None of above
2. If 𝑎 = 𝑞𝑏 + 𝑟, then
(a)gcd(a, b) ≠ gcd(b, r) (b)gcd(a, b) = gcd(b, r)
(c)gcd(a, b) = gcd(q, r) (d)None of these
3. Two consecutive terms of a Fibonacci sequence are ______.
(a)Coprime (b)Composite
(c)Inverses (d)None of these
4. The nth term of Fibonacci sequence is given by 𝐹𝑛 = __________.
(a)𝐹𝑛−1 + 𝐹𝑛−2 ∀ 𝑛 > 2 (b)𝑭𝒏−𝟏 + 𝑭𝒏−𝟐 ∀ 𝒏 ≥ 𝟐
(c)𝐹𝑛−1 − 𝐹𝑛−2 ∀ 𝑛 ≥ 2 (d)None of these
5. Which of the following is a Fibonacci sequence?
(a)1, 1, 2, 3, 4, … (b)1, 2, 3, 5, …
(c)1, 2, 3, 3, 8, … (d)1, 1, 2, 3, 5, 8, …
6. In Fibonacci sequence, the gcd(𝐹𝑛+1 , 𝐹𝑛 ) = __________.
(a)1 (b)2
(c)3 (d)0
3|Page
Lecture 4
1. If gcd(a, b) = 1 for any two integers a and b, then a and b are _________.
(a)Relatively Prime (b)Co-prime
(c)Multiples of each other (d)Both a and b
2. Which of the following are coprime?
(a)13, 26 (b)4, 29
(c)5, 12 (d)Both b and c
3. Two integers a and b are coprime if ∃ some integers x, y such that
(a)ax + by = 1 (b)ax - by = 1
(c)(ax + by)n = 1 (d)Both a and b
4. If d = gcd(a, b), then _______ are coprime.
(a)a/d and b/d (a)ad and bd
(c)d/a and d/b (d)All of these
5. If a and b are coprime then
(a)a | bc  a | c (b)a | c  b | c  ab | c
(c)lcm(a, b) = ab (d)All of these

6. For any 2 integers a and b, the product of the integers i.e. ab = _______.
(a)lcm × gcd (b)lcm + gcd
(c)lcm  gcd (d)lcm – gcd
7. Diophantine equations are named after a Greek mathematician ________.
(a)Diophantus (b)Diophantine
(c)Diophanticus (d)None of these
8. The linear Diophantine equation ax + by = c with d = gcd(a, b) has a solution in integers iff
(a)d | c (b)c | d
(c)d | (ax + by) (d)Both a and c
9. Let d = gcd(a, b) and n∈ ℕ. If d| c and (𝑥0 , 𝑦0 ) is a solution of linear Diophantine equation i.e.
𝑎𝑥 + 𝑏𝑦 = 𝑐, then all integral solutions are given by
𝒃𝒏 𝒂𝒏 𝑏𝑛 𝑎𝑛
(a)(𝒙, 𝒚) = (𝒙𝟎 + 𝒅
, 𝒚𝟎 − 𝒅
) (b)(𝑥, 𝑦) = (𝑥0 − 𝑑
, 𝑦0 + 𝑑
)
𝑎𝑛 𝑏𝑛 𝑎𝑛 𝑏𝑛
(c)(𝑥, 𝑦) = (𝑥0 + , 𝑦0 − ) (d)(𝑥, 𝑦) = (𝑥0 − , 𝑦0 + )
𝑑 𝑑 𝑑 𝑑
4|Page
Lecture 5
1. Diophantine equation is an equation that seeks its solution from the set of ______.
(a)Integers (b)Rational Numbers
(c)Complex Numbers (d)Real Numbers
2. Which one is true for the Diophantine equation 5x + 7y = 10?
(a)(5, 10)| 10 (b)(5, 7)| 10
(c)(5, 7)∤ 10 (d)None of these
3. A valid solution for the Diophantine linear equation 3x + 7y = 10 is ______.
(a)(1, 2) (b)(2, 1)
(c)(0, 3) (d)(1, 1)
4. Let d = gcd(a, b) and n∈ ℕ. If d| c and (𝑥0 , 𝑦0 ) is a solution of linear Diophantine equation i.e.
𝑎𝑥 + 𝑏𝑦 = 𝑐, then all integral solutions are given by
𝒃𝒏 𝒂𝒏 𝑏𝑛 𝑎𝑛
(a)(𝒙, 𝒚) = (𝒙𝟎 + , 𝒚𝟎 − ) (b)(𝑥, 𝑦) = (𝑥0 − , 𝑦0 + )
𝒅 𝒅 𝑑 𝑑
𝑎𝑛 𝑏𝑛 𝑎𝑛 𝑏𝑛
(c)(𝑥, 𝑦) = (𝑥0 + 𝑑
, 𝑦0 − 𝑑
) (d)(𝑥, 𝑦) = (𝑥0 − 𝑑
, 𝑦0 + 𝑑
)
5. If d = (a, b) s.t. d| c for ax + by = c, then by Extended Euclidean Algorithm, we’ve
(a)d = a(s) + b(t) (b)d = 2a(s) + b(t)
(c)d = a(s) + 2b(t) (d)None of these
6. If (a, b)=1 and a, b, c > 0, then no. of positive solutions of ax + by = c is the no. of t such that
𝒙∗ 𝒚∗ 𝑥∗ 𝑦∗
(a)− 𝒃
<𝒕< 𝒂
(b)− 𝑏
>𝑡> 𝑎
𝑥∗ 𝑦∗ 𝑥∗ 𝑦∗
(c)− 𝑎
<𝑡< 𝑎
(d)− 𝑎
<𝑡< 𝑏
Lecture 6
1. Which of the following Diophantine equations has no solution in integers?
(a)3x + 7y = 10 (b)8x – 12y = 5
(b)6x + 12y = 96 (d)5x + 10y = 25
2. If a and b are coprime, then the solution of Diophantine equation ax + by = c _____ exist(s).
(a)Always (b)May or may not
(c)Never (d)Partially
3. If (a, b)=1 and a, b, c > 0, then no. of positive solutions of ax + by = c is the no. of t such that
5|Page
𝒙∗ 𝒚∗ 𝑥∗ 𝑦∗
(a)− <𝒕< (b)− >𝑡>
𝒃 𝒂 𝑏 𝑎
𝑥∗ 𝑦∗ 𝑥∗ 𝑦∗
(c)− <𝑡< (d)− <𝑡<
𝑎 𝑎 𝑎 𝑏
Review Lecture 4
Lecture 7
Review Lecture 5
Lecture 8 & 9
1. Let m be a positive integer. Two integers a and b are congruent modulo m iff ______.
(a)m|(a – b) (b)m|(a + b)
(c)m|(a × b) (d)Both b and c
2. If a positive integer m divides the difference of 2 integers a and b i.e. m|(a-b), then
(a)a  b(mod m) (b)a = b(mod m)
(c)a  m(mod b) (d)Both a and b
3. Which of the congruence statements is false?
(a)25  15(mod 5) (b)13  10(mod 3)
(c)25  9(mod 4) (d)10  3(mod 2)
4. If a  b(mod m) then we have
(a)m as the modulus (b)b as the residue
(c)a as the modulus (d)Both a and b
5. If 2 integers are congruent modulo m then the residue r from the set {0, 1, 2, …, m-1} is called ___
(a)Least residue (b)Least positive residue
(c)Last positive residue (d)Capital residue
6. For modulus m, if every integer is congruent to an element of set S and S is smallest such set then
(a)S is complete residue system (b)S is least residue system
(c)S is complete modulo system (d)S is least modulo system
7. If S modulo m is a complete residue system(CRS), then if x ∈ S, a ∈ ℤ and m is the modulus, we’ve
(a)a  (x)(mod m) (b)x  (a)(mod m)
(c)m  (a)(mod x) (d)Both a and b
6|Page
8. Congruence is not ________.
(a)Symmetric (b)Reflexive
(c)Transitive (d)Antisymmetric
9. If a  b(mod m) and c  d(mod m), then
(a)(a + c)  (b + d)(mod m) (b)(a – c)  (b – d)(mod m)
(c)ac  bd(mod m) (d)All of these
10. For any common divisor of a, b and m, i.e. c| a, b, m; then a  b(mod m) iff
𝑎 𝑏 𝑚 𝑏 𝑎 𝑚
(a) 𝑐  𝑐 (𝑚𝑜𝑑 𝑐 ) (b) 𝑐  𝑐 (𝑚𝑜𝑑 𝑐 )
𝑚 𝑏 𝑎
(c) 𝑐  𝑐 (𝑚𝑜𝑑 𝑐 ) (d)Both a and b
11. If a  b(mod m) then for any c ∈ ℤ,
(a)ca  cb(mod m) (b)(c + a)  (c + b)(mod m)

𝑎 𝑏 𝑚
(c)𝑐  𝑐 (𝑚𝑜𝑑 𝑐 ) (d)aC  bC(mod m)
Lecture 10
1. The necessary condition for Diophantine equation ax + by = c to have integral solutions is that
(a)gcd(a, b)| c (b)c| gcd(a, b)
2. Which of the following Diophantine equations cannot be solved?
(a)6x + 51y = 22 (b)33x + 14y = 115
(c)7x + 28y = 77 (d)54x + 18y = 36
Review lectures 4 and 6
Lecture 11
1. The smallest positive integer that is the multiple of 2 numbers a and b is called _____.
(a)HCF (b)LCM
(c)GCD (d)None of these
2. The LCM of any two integers a and b is denoted by
(a)(a, b) (b)[a, b)
(c)[a, b] (d){a, b}
3. The least common multiple of 2 and 3 is
7|Page
(a)2 (b)6
(c)3 (d)23
4. For any two positive integers a and b, the LCM and GCD are related as
(a)(a, b)[a, b] = a/b (b)(a, b)[a, b] = a + b
(c)(a, b)[a, b] = a – b (d)(a, b)[a, b] = ab
5. A prime number is an integer p > 1, which has no positive divisors other than _____.
(a)1 (b)0
(c)1 and itself (d)None of these
6. If p is a prime and p| ab, then
(a)p| a (b)p| a but p∤ b
(c)p| b (d)p| a or p| b
7. Any integer n can be written as the product of ______.
(a)Naturals (b)Composites
(c)Complex Numbers (d)Primes
8. The representation of a number into product of primes is _______.
(a)Separate (b)Unique up to the order of factors
(c)Not unique (d)Infinite Number
9. The sequence of composite numbers is given by
(a)n!+2, n!+3, … ,n!+n (b)n!+2, n!+3, … ,n!+n+1
(c)n!+1, n!+2, … ,n!+n (d)None of these
Lecture 12
1. Let a and b be two integers, then a divides b if
(a)b is a multiple of a (b)a is a multiple of b
(c)a is a divisor of b (d)Both a and c
2. Let a and b be any integers, then
(a)a | b  a | kb, ∀ k ∈ ℤ (b)a | b and b | a  a = ±b
(c)a | b and b | a  b = ±a (d)All of these
3. Let a, b, and c be integers, then
(a)a | b and b | c  a | c (b)a | b and b | c  a | (sb + tc), ∀ s, t ∈ ℤ
8|Page
4. Let a and b be positive integers, then ∃ unique integers q and r such that
(a)b = aq + r with 0 ≤ r < a (b)b = aq - r with 0 ≤ r < a
(c)a = bq + r with 0 ≤ r < a (d)b = aq + r with 0 > r ≥ a
5. The greatest common divisor of a and b is the ______ linear combination of a and b.
(a)Smallest positive (b)Smallest negative
(c)Largest positive (d)Only positive
6. If a | c, b | c and (a, b) = 1, then
(a)ab | c (b)bc | a
(c)a | bc (d)c | ab
7. If (a, b) = (a, c) = 1, then
(a)(a, bc) = 1 (b)(ab, c) = 1
(c)(a, b + c) = 1 (d)(a, b – c) = 1
8. Which name matches the statement if a|bc and (a, b) = 1, then a|c ?
(a)Euclid’s Lemma (b)Fermat’s Theorem
(c)Division Algorithm (d)Euclidean Algorithm
9. Every integer n is product of primes such that
(a)n > 1 (b)n > 2
(c)n < 1 (d)n > 0
10. According to Euclid, there exist how many primes?
(a)A few (b)Finite
(c)Infinite (d)None of these
Review Lectures 8 and 10
Lecture 13
1. The set of integers such that every integer is congruent modulo m to exactly one integer of the set
is called ______ modulo m.
(a)Reduced Residue System(RRS) (b)Complete Residue System(CRS)
(c)Elementary Residue System(ERS) (d)None of these
2. Which set of integers forms a complete residue system for modulus 5?
(a)1, 2, 3, 4, 5 (b)6, 7, 8, 9, 10
9|Page
(c)0, 1, 2, 3, 6 (d)None of these
3. A reduced residue system modulo m is a set of integers 𝑟𝑖 s.t.
(a)[𝑟𝑖 , 𝑚] = 1 (b)(𝒓𝒊 , 𝒎) = 1
(c)(𝑟𝑖 , 𝑚) ≠ 1 (d)None of these
4. The RRS modulo 6 contains the set of integers _____.
(a){0, 5} (b){1, 5}
(c){1, 2, 3} (d){1, 3, 6}
Elementary Properties of Congruence:
Let a, b, c, d ∈ ℤ and let m be a fixed positive integer, then
i. ∀ a ∈ ℤ, a  a(mod m) (Reflexive)
ii. If a  b(mod m), then b  a(mod m) (Symmetric)
iii. If a  b(mod m) and b  c(mod m), then a  c(mod m) (Transitive)
iv. If a  b(mod m) and c  d(mod m) then for any integer c,
a ± c  b ± d(mod m) and ac  bd(mod m)
v. If a  b(mod m). Then ca  cb(mod m) for any integer c
𝑎 𝑏 𝑚
vi. For any common divisor c of a, b, and m, we’ve a  b(mod m) iff  ቀ𝑚𝑜𝑑 ቁ
𝑐 𝑐 𝑐
vii. If a  b(mod m), then an bn(mod m) for any positive integer n
viii. If f(x) is any polynomial with integer coefficients and a  b(mod m) then
f(a)  f(b)(mod m)
Lecture 14
Let 𝑎𝑘 10𝑘 + 𝑎(𝑘−1) 10𝑘−1 + ⋯ + 𝑎0 is the decimal expansion of the integer n, then
1. n is divisible by 2𝑟 , iff
(a)number has 2𝑟 digits (b) 𝟐𝒓 | no. consisting of last r digits
(c)n is divisible by r (d) 2𝑟 | no. consisting of last 2𝑟 digits
2. n is divisible by 3, iff
(a)3| no. consisting of last 3 digits (b)𝟑|𝒂𝒌 + 𝒂𝒌−𝟏 + ⋯ + 𝒂𝟎
(c)n is divisible by 3𝑟 (d)n has 3 digits
(a)9| no. consisting of last 9 digits (b)9|𝒂𝒌 + 𝒂𝒌−𝟏 + ⋯ + 𝒂𝟎
(c)n is divisible by 9𝑟 (d)n has 9 digits
10 | P a g e
(a)11| no. consisting of last 11 digits (b)11|𝑎𝑘 + 𝑎𝑘−1 + ⋯ + 𝑎0
(c)𝟏𝟏|𝒂𝟎 − 𝒂𝟏 + 𝒂𝟐 − ⋯ + (−𝟏)𝒌 𝒂𝒌 (d)n has 11 digits
5. Which number is not divisible by 8 = 23?
(a)223317888 (b)12345678
(c)234789120 (d)976
6. Which number is not divisible by 3?
(a)123456 (b)12345678
(c)1234567 (d)123
7. Which number is divisible by 9?
(a)12345678 (b)1234567
(c)123456 (d)12345
8. Which number is divisible by 11?
(a)1571724 (b)3636567
(c)611226 (d)All of these
Lecture 15
1. Linear congruence is of the form ______ .
(a)ax  b(mod m) (b)ax = b(mod m)
(c)ax2 + bx = c(mod m) (d)Both a and b
2. Two integers s and t that are not congruent to each other w.r.t. mod m are said to be _____.
(a)Equivalent (b)Incongruent
(c)Coprime (d)None of these
3. Let d = (a, m), then the congruence ax  b(mod m) has a solution iff
(a)b| d (b)m| d
(c)d| b (d)a| d
4. The solution of linear congruence 2x  1(mod 3) is ______.
(a)x  2(mod 3) (b)x  1(mod 3)
(c)x  0(mod 3) (d)None of these
5. The solution of linear congruence 4x  1(mod 6) is ______.
(a)x  2(mod 6) (b)x  3(mod 6)
11 | P a g e
6. The number of mutually incongruent solutions of linear congruence 42x  90(mod 156) is
(a)3 (b)2
(c)5 (d)6
Lecture 16
1. A congruence of the form ax  b(mod m) is called ________.
(a)Linear congruence (b)Coefficient congruence
(c)Integral congruence (d)None of these
2. Which of the following is a valid solution to the congruence 2x  1(mod 5)?
(a)x  3(mod 5) (b)x  1(mod 5)
(c)x  4(mod 5) (d)x  5(mod 5)
3. The elements in the solution set of a linear congruence are ________ to each other.
(a)Always congruent (b)Maybe congruent
(c)Never congruent (d)None of these
4. If d = (a, m), then the congruence ax  b(mod m) has a solution if
(a)d| b (b)b| d
(c)d| b-am (d)None of these
5. If d = (a, m), and d | b; then ∃ _________ solution modulo m for congruence ax  b(mod m).
(a)exactly d mutually incongruent (b)Maybe d mutually incongruent
(c)exactly d mutually congruent (d)Maybe d mutually congruent
6. If (a, m) = d| b, then for x* being a solution of ax  b(mod m); d mutually incongruent solutions are
𝒎 𝑚
(a)𝒙  𝒙∗ + ቀ 𝒅 ቁ 𝒕(𝒎𝒐𝒅 𝒎), t=0, 1, …, d-1 (b)𝑥  𝑥 ∗ − ቀ 𝑑 ቁ 𝑡(𝑚𝑜𝑑 𝑚), t=0, 1, …, d-1
𝑚
(c)𝑥  𝑥 ∗ + ቀ 𝑑 ቁ 𝑡(𝑚𝑜𝑑 𝑚), t=0, 1, …, d (d)𝑥  𝑥 ∗ + (𝑚)𝑡(𝑚𝑜𝑑 𝑚), t=0, 1, …, d-1
Lecture 17
1. The solution of linear congruence 2x  4(mod 12) is _______.
(a)x  2(mod 12) (b)x  8(mod 12)
(c)x  6(mod 12) (d)Both a and b
2. The solution of congruence 42x  90(mod 156) is _______ .
12 | P a g e
(a)x  16(mod 156) (b)x  121(mod 156)
(c)x  17(mod 156) (d)Both b and c
3. An integer a is said to be an inverse of an integer b w.r.t. mod m if
(a)a  b(mod m) (b)ax  b(mod m)
(c)ab  -1(mod m) (d)ab  1(mod m)
4. Which of the following is inverse of 3 mod 5?
(a)2 (b)1
(c)3 (d)4
5. Which of the following are inverses of each other?
(a)3, 7 w.r.t. mod 20 (b)2, 5 w.r.t. mod 9
(c)4, 7 w.r.t. mod 9 (d)All of these
6. If a is inverse of a* and b is inverse of b*, then ab is inverse of ____ w.r.t. mod m.
(a)a* (b)b*
(c)a*b* (d)None of these
Lecture 18 & 19
𝑎1 𝑥 ≡ 𝑏1 (𝑚𝑜𝑑 𝑚1 )
𝑎 𝑥 ≡ 𝑏2 (𝑚𝑜𝑑 𝑚2 )
1. System of the form { 2 with fixed positive integers m1, m2, …, mr is called
…
𝑎𝑟 𝑥 ≡ 𝑏𝑟 (𝑚𝑜𝑑 𝑚𝛤 )
(a)System of Linear congruence (b)System of Congruences
(c)System of Modulo mi (d)None of these
2. An integer c satisfying all linear congruences in the system is called ______ of the system.
(a)Simultaneous integer (b)Simultaneous solution
(c)Key (d)Both a and c
3. Which of the following congruences is satisfied by the integer x = c = 3?
(a)2x  1(mod 5) (b)5x  1(mod 7)
(c)4x  1(mod 11) (d)All of these
4. Suppose that 𝑚𝑗 are pairwise relatively prime and 𝑎𝑗 are arbitrary integers(j=1, … , k), then ∃
solutions x to the simultaneous congruences x  𝑎𝑗 (mod 𝑚𝑗 ) s.t. the solutions x are _______.
(a)Congruent Modulo M=𝒎𝟏 . 𝒎𝟐 … 𝒎𝒌 (b)Congruent Modulo M=∑𝑘𝑗=1 𝑚𝑗
(c)Congruent Modulo 𝑚1 (d)Both a and b
13 | P a g e
5. The above statement(4) is called ____________.
(a)Euler’s Theorem (b)Fermat’s Little Theorem
(c)Chinese Remainder Theorem (d)Congruence Theorem
6. Let 𝑚1 , 𝑚2 , … , 𝑚𝑟 > 0 be pairwise relatively prime, then simultaneous solution of the system given
𝑎1 𝑥 ≡ 𝑏1 (𝑚𝑜𝑑 𝑚1 )
𝑎 𝑥 ≡ 𝑏2 (𝑚𝑜𝑑 𝑚2 )
by { 2 is __________________.
…
𝑎𝑟 𝑥 ≡ 𝑏𝑟 (𝑚𝑜𝑑 𝑚𝛤 )
(a)Unique modulo 𝒎𝟏 . 𝒎𝟐 . 𝒎𝟑 … 𝒎𝒓 (b)Not unique
𝑚1 𝑚2 𝑚
(c)Unique modulo . … 𝑎𝑟
𝑎1 𝑎2
(d)None of these
𝑟
7. The solution for linear congruence 17x  9(mod 276) is ______ .
(a)x  33(mod 276) (b)x  30(mod 276)
Lecture 20 & 21
1. Which of the statements is false?
(a)There is no pattern in prime numbers (b)No formula exists for prime numbers
2. How many even prime numbers exist?
(a)Only one (b)Only 20
(c)Infinite many (d)No even prime exists
3. A congruence of the form 𝑥 2  a(mod m) is called ________ .
(a)Linear congruence (b)Quadratic congruence
(c)Cubic congruence (d)Polynomial congruence
4. If solution for 𝑥 2  a(mod p) exists, s.t. p(odd prime) doesn’t divide a, then it has ___.
(a)Precisely 2 incongruent solutions (b)Exactly 1 solution
(c)More than 2 incongruent solutions (d)Infinite many solutions
5. According to fundamental theorem of algebra, every n degree polynomial has ________.
(a)At least n roots (b)At most n roots
(c)Exactly n roots (d)n-1 roots
6. Any quadratic congruence modulo 2 i.e. 𝑥 2  a(mod 2) has _______ solution(s).
(a)One (b)Two
14 | P a g e
(c)At least one (d)At most one
7. If solutions for 𝑥 2  a(mod m) exists where m is a composite number, then the congruence has
(a)Exactly 2 solutions (b)No solutions
(c)At least 2 solutions (d)At most 2 solutions
8. Any congruence of the form 𝑥 2  a(mod 4) has _________.
(a)No solution or 2 solutions (b)Exactly 2 solutions
(c)At least 2 solutions (d)At most 2 solutions

𝑝−1
9. Let 𝑥 2  a(mod p) where p∤a; then by Dirichlet Theorem, (p-1)!  𝑎 2 (mod p) indicates
(a)No solution (b)At least 2 solutions

(c)Exactly 2 solutions (d)None of these
𝑝−1
10. Let 𝑥 2  a(mod p) where p∤a; then by Dirichlet Theorem, (p-1)!  −𝑎 2 (mod p) indicates
(a)No solution (b)At least 2 solutions

(c)Exactly 2 solutions (d)None of these
11. Which theorem states that “If p is prime, then (p-1)!  -1(mod p).”?
(a)Dirichlet’s Theorem (b)Wilson’s Theorem

(c)Euler’s Theorem (d)Fermat’s Little Theorem
𝑝−1
12. Let 𝑥 2  a(mod p) where p∤a; then by Euler’s Criterion, 𝑎 2  1(mod p) indicates
(a)No solution (b)Solution exists

(c)Solution may exist (d)None of these
𝑝−1
13. Let 𝑥 2  a(mod p) where p∤a; then by Euler’s Criterion, 𝑎 2  -1(mod p) indicates
(a)No solution (b)Solution exists

(c)Solution may exist (d)None of these
In the above segment, p represented an odd prime
Lecture 22 & 23
1. Let p be an odd prime. Then 𝑥 2  -1(mod p) has a solution if p is of the form _________.
(a)4k+1 (b)4k
(c)4k+3 (d)None of these
2. Let p be an odd prime. Then 𝑥 2  -1(mod p) has no solution if p is of the form _________.
(a)4k+1 (b)4k
15 | P a g e
(c)4k+3 (d)None of these
3. “Let p be a prime and p doesn’t divide a. Then 𝑎𝑝−1  1(mod p).” is a statement of
(a)Dirichlet’s Theorem (b)Fermat’s Little Theorem

(c)Euclid’s Theorem (d)Wilson’s Theorem
4. Let p be a prime number and p does not divide a. Then
(a)𝑎𝑝−1  1(mod p) (b)𝑎𝑝  𝑎(mod p)

5. By Fermat’s Little Theorem, 2𝑝 − 2 is divisible by 2p, since
(a)2𝑝  2(mod p) (b)2|2𝑝 − 2
(c)𝑝|2𝑝 − 2 (d)All of these
6. Let 𝑎, 𝑢, 𝑣 be integers s.t. 𝑢, 𝑣, 𝑚 > 0 and d=(𝑢, 𝑣). If 𝑎𝑢  1(mod m) and 𝑎𝑣  1(mod m), then
(a)𝒂𝒅  1(mod m) (b)𝑎𝑑−1  1(mod m)
(c)𝑎𝑑  𝑎(mod m) (d)None of these

7. Let p be prime and p ∤ a. Let n be the smallest positive integer s.t. 𝑝|𝑎𝑛 − 1. Then
(a)n| p-1 (b)n| p
(c)n| p+1 (d)p| n
Euler Φ-Function: If m>1. Then Φ(m) is the count of integers less than m and relatively
prime to m. Mathematically Φ(m) = 𝑐𝑜𝑢𝑛𝑡{𝑛 < 𝑚|𝑛 ∈ ℤ+ |(𝑛, 𝑚) = 1}.
8. Euler Φ-Function of a prime number p i.e. Φ(p) = _________.
(a)p (b)p-1
(c)p/2-1 (d)None of these
Reduced Residue System: Let m > 0, then the set of integers s.t. every number which is
relatively prime to m is congruent modulo m to a unique element of the set is called
Reduced Residue System Modulo m.
9. The reduced residue system(RRS) is _______ of complete residue system(CRS).
(a)Compliment (b)Subset
(c)Not a subset (d)Both a and c
10. For which values of m, CRS = RRS?
(a)If m is a prime (b)If m is a consonant
(c)If m < 10 (d)None of these
11. If ca  cb(mod m) then
16 | P a g e
𝒎
(a)a  𝒃 ቀ𝒎𝒐𝒅 (𝒄,𝒎)ቁ (b)a  𝑏(𝑚𝑜𝑑 𝑚)
(c) a  𝑏(𝑚𝑜𝑑 𝑚. (𝑐, 𝑚)) (d)None of these
17 | P a g e

Number Theory MCQs

Uploaded by

Copyright:

Available Formats

Number Theory MCQs

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Number Theory MCQs

Uploaded by

Copyright:

Available Formats

Multiple Choice Questions

Number Theory BS Mathematics 2017-2021

5. Both addition and multiplication in ℤ are _________.

(c)Distributive (d)All of these

6. If 𝑎 = 𝑞𝑏 for some integers q and 𝑎, 𝑏 ≠ 0 then we say that

(a)b divides a (b)b is a factor of a

(c)a is a multiple of b (d)All of these

7. If b ≠ 0 ∈ ℤ ,then which statement is correct?

(c)0|b (d)None of these

8. For any integer a ∈ ℤ, mark the correct statement.

(c)0|a (d)None of these

vi. a| b and b| a iff a = ±b.

9. If S is a non-empty set of non-empty integers, then S has a least element c ∈ S, s.t.

(a)c ≤ x, ∀ x ∈ S (b)c < x, ∀ x ∈ S

(c)x ≤ c, ∀ x ∈ S (d)None of the above

11. Which one of the following holds for all n∈ ℕ ?

(a)3𝑛+1 < 2𝑛 + 2 (b)3𝑛 < 2𝑛 + 1

(c)𝟑𝒏 ≥ 𝟐𝒏 + 𝟏 (d)3𝑛 > 2𝑛 + 1

(a)0 ≤ r ≤ |b| (b)0 ≤ r < |b|

(c)0 > r > |b| (d)0 ≤ r ≤ b

(a)Integer (b)Positive Integer

(c)Real number (d)Negative Integer

2. Which one can be written as a linear combination of any 2 integers involved?

(a)GCD (b)Decimal expansion

(c)LCM (d)None of these

3. Any positive integer n can be written uniquely as 𝑛 = 𝑐𝑘 . 𝑏 𝑘 + 𝑐𝑘−1 . 𝑏 𝑘−1 + ⋯ + 𝑐1 . 𝑏 + 𝑐0 , if

(a)b > 1 (b)0 ≤ ci < b

(c)ck ≠ 0 (d)All of these

(a) gcd(a, b) = ax + by (b) gcd(a, b) = ax – by

(c) gcd(a, b) = axn + byn (d) gcd(a, b) = (ax + by)n

5. Which one of the statements is equal to 8?

(a) gcd(1, 8) (b) gcd(-32, 44)

(c) gcd(12, 42) (d) gcd(-32, 96)

(c)If c | a ∧ c | b then c ≤ d (d)All of these

(c)Both a and b (d)None of these

(a)Well ordering principle (b)Division Algorithm

(c)Euclid’s Algorithm (d)None of above

(a)gcd(a, b) ≠ gcd(b, r) (b)gcd(a, b) = gcd(b, r)

(c)gcd(a, b) = gcd(q, r) (d)None of these

3. Two consecutive terms of a Fibonacci sequence are ______.

(c)Inverses (d)None of these

4. The nth term of Fibonacci sequence is given by 𝐹𝑛 = __________.

(a)𝐹𝑛−1 + 𝐹𝑛−2 ∀ 𝑛 > 2 (b)𝑭𝒏−𝟏 + 𝑭𝒏−𝟐 ∀ 𝒏 ≥ 𝟐

(c)𝐹𝑛−1 − 𝐹𝑛−2 ∀ 𝑛 ≥ 2 (d)None of these

5. Which of the following is a Fibonacci sequence?

6. In Fibonacci sequence, the gcd(𝐹𝑛+1 , 𝐹𝑛 ) = __________.

(a)Relatively Prime (b)Co-prime

(c)Multiples of each other (d)Both a and b

2. Which of the following are coprime?

(c)5, 12 (d)Both b and c

3. Two integers a and b are coprime if ∃ some integers x, y such that

(c)(ax + by)n = 1 (d)Both a and b

4. If d = gcd(a, b), then _______ are coprime.

(a)a/d and b/d (a)ad and bd

(c)d/a and d/b (d)All of these

5. If a and b are coprime then

(c)lcm(a, b) = ab (d)All of these

(a)lcm × gcd (b)lcm + gcd

(c)lcm  gcd (d)lcm – gcd

7. Diophantine equations are named after a Greek mathematician ________.