Scribd
Upload
51 views2 pages

Question Paper of Number Theory

The document is an examination paper for the Number Theory course BSCHMTMDSE602. It contains 4 questions with multiple parts testing concepts such as primitive roots, modular arithmetic, and properties of arithmetic functions.

Uploaded by

Bibek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views2 pages

Question Paper of Number Theory

The document is an examination paper for the Number Theory course BSCHMTMDSE602. It contains 4 questions with multiple parts testing concepts such as primitive roots, modular arithmetic, and properties of arithmetic functions.

Uploaded by

Bibek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total page:2 BSCHMTMDSE602

UG 6h Semester Examination 2024

Award: B.Sc. (Honours)


Discipline: Mathematics
Course Type: DSE(Hons.)
Course Code: BSCHMTMDSE602
Course Name: Number Theory

Full Marks: 40 Time: 2 Hrs


-------------------------------------------------------
(The figures in the right-hand margin indicate full marks. Candidates are required to give their
answers in their own words as far as practicable. Notations and symbols have their usual meaning)

1. Answer any five questions 1×5=5


(a) Calculate ϕ(n) for n = 5040.
(b) Define reduced residue system.
(c) State Fundamental theorem of arithmatic.
(d) Give an example to show that a2 ≡ b2 (mod n) need not imply that a ≡ b (mod n).
 
(e) If p be a prime & k is a positive integer, then show that ϕ(pk ) = pk p + p1 .
n
(f) If Fn = 22 + 1, n > 1, n is prime, then 2 is not a primitive root of Fn .
(g) Show that Goldbach conjecture implie that every even integer greater than 5 is a sum
of three primes.
(h) Define Mersenne Prime.

2. Answer any five questions 2 × 5 = 10


(a) Prove that n > 3, the integers n, n + 2, n + 4 can not ne all primes.
(b) Find the sum of all even positive divisors of 2700.
(c) Find the least positive residues in 336 (mod 77).
(d) Solve x2 + 3x + 11 ≡ 0 (mod 13).
(e) If d1 , d2 , . . . , dr be the list of positive divisors of a postive divisors of a positive integer
n then prove that d11 + d12 + . . . + d1r = σ(n) n
.
(f) Decrypt IABEHEHZR using linear eipher c ≡ p − 7 (mod 26).
(g) Define Dirichlet product of two arithmetical functions and show that it is commutative.
(h) Using Wilson’s theorem show that 18! + 1 ≡ 0 (mod 23).

3. Answer any three questions 3 × 5 = 15


(a) Find the least positive integers which leaves remainders 2,3 and 4when divided by 3,5
and 11 respectively.
(b) i. Encrypt the plain text message ‘MEDAL’ using RSA algorithm with key (2561,3).
ii. If gcd(m.n)=1,where m > 2, n > 2 then prove that the integer mn has no primitive
root. (3+2)
P
(c) i. If f(n) is a multiplicative function(not identically zero), then prove that µ(d)f (d) =
d/n
(1 − f (p1 )) (1 − f (p2 )) . . . (1 − f (pk )).
ii. Prove that, the necessary and sufficient condition that ‘a’ when gcd(a,m)=1 to be a
primitive root of m is that the numbers a, a2 , . . . , aϕ(m) . (2+3)
(d) i. State and prove Mobius inversion formula.
ii. Show that 3 is quadratic residue of 23 but a non residue of 31. (3+2)
20
(e) i. Show that 19 ≡ 1 (mod 181).
ii. Let k > 1 and 2k − 1 is a prime. If n = 2k−1 (2k − 1), then show that n is a perfect
number. (2+3)

4. Answer any one question 1 × 10 = 10


(a) i. Let p be an oddprime
 &
 let
 a,b
 be two integers that are relatively prime to p.
ab a b
Then show that p = p p
.
ii. Prove that for k ≥ 3, the integer 2k has no primitive roots.
iii. Show that 34n+2 +52n+1 ≡ 0 (mod 14) (4+4+2)
(b) i. Find the primitive roots of 41.
ii. If p be a prime number and d/p-1 then show that the congruence xd − 1 ≡ 0
(mod p) has exactly d number of incongruent solutions. (5+5)
(c) i. Solve: x2 ≡ 14 (mod 52 )
ii. If p is an odd prime, then show that
 
1
− = 1, if p ≡ 1 (mod 4)
p
= −1, if p ≡ 3 (mod 4)

iii. Prove that for n > 1, the sum of the positive integers less than n and relatively
prime to n is 21 nϕ(n). (5+2+3)

Page 2

You might also like