Scribd
Upload
7 views

Number Theory(2023,2022)

The document outlines an examination paper for a course on Number Theory, including various topics such as Diophantine equations, prime counting functions, and multiplicative functions. It consists of multiple questions requiring proofs, calculations, and definitions related to number theory concepts. The paper has a total of 80 marks, with a passing mark of 32, and is designed to be completed in 3 hours.

Uploaded by

monmohandmj02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
7 views

Number Theory(2023,2022)

The document outlines an examination paper for a course on Number Theory, including various topics such as Diophantine equations, prime counting functions, and multiplicative functions. It consists of multiple questions requiring proofs, calculations, and definitions related to number theory concepts. The paper has a total of 80 marks, with a passing mark of 32, and is designed to be completed in 3 hours.

Uploaded by

monmohandmj02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 11
- : TT rl Paper : DSE-2.3 ( Number Theory ) Full Marks : 80 Pass Marks : 32 Time : 3 hours 1. (a) Write the Goldbach conjecture. 1 a (b)/ Can the Diophantine equation Vo 14x+35y=93 be solved? Give reasons to your answer. 2 ()/ Write the value of 1(30), where 1(x) denotes the prime counting function. ! (d) If a=b(mod m) and x= y(mod m), then Prove that ax = by(mod m). : va Find the remainder when 15! is divided by, 17. 24P/448 (Continued! (11) g, Answer any three of the following A 43819 (ajv Find the genera) Soluti equation 5x+3y=59, tion of the (b) Use Fermat’s theorem to veri 17 divides 1119 47, oe Sone the simultaneous congruence : S(mod 7) x= 7(mod 11) x =3(mod 13) (a) If pbe a prime number, then show that (p-1)!=(p-1) (mod. +2+3+--- + p-1)) (e)_ Prove that if p is a prime, then a? =a(mod p) for any integer a 3. (a) Write the value of o(p), where p is \ A prime. (0) Prove that for each positive integer % 2 H(n) u(r +) p(n +2) p(n +3) = O- og 4212 4 Answer any four of the following * + >1 (4) Prove that for any integer 7 a(n) n2 =Nd din (Tum over) *P/agg (12) (b) UF isa multiplicative function and Fin)= YI d|n then prove that f is also multiplicative, (c)_/ Prove that the function o js multiplicative. (dy Find the highest power of 7 that divides ~~ 2000! (e) Forn>2, prove that $(n) is even integer, 5. (a),/Use Euler’s theorem to establish any ; VY one of the following : 5 (i) For any integer n20, 51 divides 1032" +9 7 (ii) For any integer a, a®” = a(mod1729), given that 1729 =7x13x19 a For any positive integer n, prove that dn)=n> nia) din Also verify it for n=12. () Define Dirichlet product of arithmetic |, functions. Also prove that (f+ g)*h= f*(g*h), where f, g and h are arithmetic functions and ‘*’ denotes their Dirichlet Product. 24P/448 (Continuet! Lh 5 (13) Or Prove that if f and g are both multiplicative functions, then their Dirichlet product f*g is also multiplicative. 6. (a) Find the order of 5 modulo 12 and hence determine the order of 5° modulo 12. 2 @) Prove that if a has order 2k modulo an odd prime p, then ak =-l(modp). 3 7. Answer any five of the following : 5x5=25 (a) If ais a primitive root of m, then show that a* is also a primitive root of m if and only if (k, o(m)) =1. (b) Show that the primitive root of 13 are given by S={2",1sn2 and n>2, Yo then prove that the integer mn has no primitive roots. (a) Write the Euler’s criterion for quadratic residue of an odd prime. Find which of the integers 1, 2,3,.,12 are quadratic residues of 13 and which are non residues of 13. rurh Over) 24P/aag (turn (14) (e)_ State quadratic reciprocity law. Also ) 29 ~~ find the value of (2). i) Solve the following quadratic 4 congruence : x? +7x+10 =0(mod 11) (g) Define Legendre symbol (¢} where p a P. is an odd prime and gced(a, p) =1. Prove that a=b(modp) => (3] = (2} Hence P. P show that (3) -(#) 11 11 th) Show that if pis an odd prime, then “3 a=1\P Vie that 7 and 18 are the only incongruent solution of x? = -1(mod5?). ) The message IwWGA IU ZWU has been encoded with a Caesar cipher. Decipher it, using exhaustive cryptoanalysis. 24P/448 (Continued) (13) Paper : DSE-2.3 ( Number Theory ) Full Marks : 80 kee Pass Marks : 32 Time : 3 hours 1. (a) Define a linear Diophantine equation. 1 (b) If p be a prime number and a be any integer, then prove that either pla or (a p)=1. 2 (c) Find the general solution of 10x - 8y = 42. 3 (d) If a b, c be integers such that ac = bc(modm) and d=(c m), then show that az of mod. ") 4 Or State and prove fundamental theorem of arithmetic. Over ) P23/545 (Tum mre (14) 2. (a) Define CRS (modm). (b) What is the remainder when 548 divided by 12? is 2 (c) Solve 6x =15(mod 21). 3 —_— 7” (a) Prove that an integer pis a prime if and a only if (p-1)!= -1(mod p) 4 Or - State and prove Chinese remainder . theorem. . Define Mébius function. 1 (b) Find t(n) and o(n), when n=12. 3 (c) Prove that (| O(n) _ z u(d@) a n dm @ Or Find doa) ifn=12. din P23/545 ( Continued ) (@) () 4. (a) 23/545 (15 ) If n be an integer >1, then show that t(n) is odd ¢ n is a perfect square. 3 If f is a multiplicative arithmetic function, then prove that an) = Yfld) and goin)= Lula) f(a) din djn are both multiplicative arithmetic functions. 5 Or If n= px pe ees per is the prime factorization of n>1, then prove that pett-1 ppth-1 pktt-1 o(n)= c Pi-1 pa-l Pro and t(n) = (ky +1)(ko +1)... (k +1) If x and y be any real numbers, then show that— (i) [x+m]=[x]+m, m be any integer; (i) [x] +(y) Six+y] Sel +) +2 2+2=4 ( Turn Over ) ( 16) If n be any integer >2, then prove that yy o(n) is even. (© (da) 5. (@) (b) P23/545 3 valuate (450). 3 ta and m>O be integers such that (a, m)=1, then prove that o(m) = a =1(modm) 5 - Or For each positive integer n21, then show that n= () d[n the sum being extended over all positive divisors of n. If a be an integer having exponent h modulo m, ie. a” =1(modm), then prove that (a m)=1 that is a and m are coprime. 2 If a has exponent h modulo m then prove that a* has exponent k, where 4 d=(h, k). ( Continued ) (17) (c) Find the primitive roots (mod 7). 4 (d) Define Legendre symbol and if p be an odd prime and a, b be any integers coprime to p, then prove that (F(A) ° Let a be any odd integer, then show that a2"? 21(mod2"), Vn23 6. (a) Evaluate the Legendre symbol (2). (b) Show that the number of primes is not finite. (c) Encrypt the message ‘RETURN HOME’ using Caesar cipher. (@) If x, y, z is a primitive Pythagorean triple, then show that one of the integers x and y is even, while the other is odd. °23/s45 ( Turn Over ) (18 ) (e) If pis an cae prime and (a, p) = 1, then show that x? = a(mod p* ) kK2l has a solution if and only if (3) =1. P. 5 Or Frei that an integer a is a quadratic residue (modp) if and only if a rs =1(mod p). ( Continued ) P23/545 — ©

You might also like