R

Roll No. ........................ Total Pages : 4 (b) If g is the greatest common divisor of b and c,
then there exist integers x0 and y0 such that
13724/NH g = (b,c) = bx0 + cy0. 3

C–2111 2. (a) State and prove Wilson’s theorem. 3

NUMBER THEORY–I (b) Prove that there exist no pairs of integers

x, y satisfying x + y = 100 and (x,y) = 3. 3
Option–II

3. (a) State and prove Fundamental theorem of

Semester–V
Arithmetic. 3
Time Allowed : 3 Hours] [Maximum Marks : 40
(b) Find all integers that satisfy simultaneously

Note : The candidates are required to attempt two x ≡ 2 (mod3), x ≡ 3 (mod3) and x ≡ 5 (mod2).

questions each from Sections A and B carrying 3

6 marks each and the entire Section C 4. (a) State and prove Euler-Fermat theorem. 3
consisting of 8 short answer type questions
(b) Let a, b and m > 0 be given integers and put
carrying 2 marks each. g = (a, m). The congruence ax ≡ b (modm) has
a solution if and if g|b. If this condition is
SECTION—A
met, then the solutions form an arithmetic
1. (a) Let p be a prime number. Then x 2 ≡ 1 (modp) if progression with common difference m/g, giving
and only if x ≡ ±1 (modp). 3 g solution (modm). 3

13724/NH/2/W/6,910 [P. T. O. 13724/NH/2/W/6,910 2

 SECTION—B
5. (a) If p is an odd prime and g is a primitive root
modulo p2, then g is a primitive root modulo
p α for α = 3, 4, 5, ......
(ii) Using Euclidean algorithm, find the greatest
common divisor of 2689 and 4001.
(iii) Show that if d|n, then φ(d)|φ(m).
3 (iv) Prove that n|(n – 1)! for all composite

(b) Suppose that p is an odd prime. Let n denote numbers n > 4.

the least positive quadratic non-residue modulo (v) Find a positive integer n such that :
p. Then n < 1 + p. 3
µ(n) + µ(n + 1) + µ(n + 2) = 3.
6. State and prove Gauss lemma. 6
(vi) Determine whether x 2 ≡ –2 (mod118) is
7. (a) State and prove Mobius Inversion Formula. 3 solvable or not.

(b) Prove that the Euler’s function φ is (vii) Determine the number of solutions of the
multiplicative. 3 Congruence x 4 ≡ 61 (mod117).

8. If p is a prime, then there exist φ (p – 1) primitive (viii) Show that n7– n is divisible by 42 for any
roots mod p. 6 integer n.

SECTION—C

9. Answer the following : 8×2=16

(i) Find all solutions of the Congruence

64x ≡ 83 (mod105).

13724/NH/2/W/6,910 3 [P. T. O. 13724/NH/2/W/6,910 4