Scribd
Upload
82 views2 pages

Year - B.Sc. II (CBCS Pattern) Sem-IV Subject - USMT-08 - Mathematics Paper-VIII (Elementary Number Theory)

This document outlines the topics and questions for a mathematics exam on elementary number theory. It covers four units: divisibility and congruences, properties of integers, modular arithmetic, and additional number theory topics. The exam contains 5 questions testing concepts like prime factorization, greatest common divisors, modular arithmetic, and properties of Pythagorean triples.

Uploaded by

Ramnaresh
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
82 views2 pages

Year - B.Sc. II (CBCS Pattern) Sem-IV Subject - USMT-08 - Mathematics Paper-VIII (Elementary Number Theory)

This document outlines the topics and questions for a mathematics exam on elementary number theory. It covers four units: divisibility and congruences, properties of integers, modular arithmetic, and additional number theory topics. The exam contains 5 questions testing concepts like prime factorization, greatest common divisors, modular arithmetic, and properties of Pythagorean triples.

Uploaded by

Ramnaresh
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

B.Sc.

II (CBCS Pattern) Sem-IV


USMT-08 : Mathematics Paper-VIII (Elementary Number Theory)
P. Pages : 2 GUG/S/19/12015
Time : Three Hours *3801* Max. Marks : 60
_____________________________________________________________________
Notes : 1. Solve all five questions
2. All questions carry equal marks.

UNIT – I

1. a) Let a and b be integers such that b > 0 then prove that there are unique integers q and r 6
such that a = bq + r with 0 < r < b.

b) Prove that 3| n ( n + 1)( 2n + 1) , n  Z. 6

OR

c) Find the values of x and y to satisfy the equation 423x + 198y = 9. 6

d) Prove that for positive integers a and b (a, b) [a, b] = ab. 6

UNIT – II

2. a) If p is a prime and p | a1 a 2 − − − a n , then prove that p divides at least one factor a i of the 6
product.

b) Find the g.c.d. and L.c.m. of a = 18900 and b = 17160 by writing each of the number a 6
and b in prime factorization canonical form.

OR

c) Prove that Fermat number F5 is divisible by 641 and hence is composite. 6

d) n −1 6
If Pn is the nth prime number then prove that pn  22

UNIT – III

3. a) Let a, b, c be integers such that a  b ( mod m ) then prove that 6


i) ( a + c )  ( b + c )( mod m ) ii) ( a − c )  ( b − c )( mod m ) iii) ac  bc ( mod m )

b) Prove that congruence is an equivalence relation. 6

OR

c) What is the remainder when the sum 6


5 5 5 5
1 + 2 + 3 + ..... + 200 is divided by 4?.

d) Prove that a  b ( mod m1 ) and a  b ( mod m 2 ) if and only if a  b ( mod  m1, m2 ) 6

GUG/S/19/12015 1 P.T.O
UNIT – IV

4. a) a a 6
If f is a multiplicative function and if n = p11 p22 − − − −pamm is the prime-power

(a) (a) (
factorization of the positive integer n, then prove that f ( n ) = f p11 f p22 − − − f pamm .)
b) Solve linear congruence 4x  7 ( mod15) by using Euler's theorem. 6

OR

c) If x, y, z is a primitive Pythagorean triple then prove that (x, y) = (y, z) = (z, x) = 1. 6

d) Find all relatively Prime solutions of x 2 + y2 = z2 with 0  z  30 . 6

5. Attempt any six.

a) If a | bc & ( a, b ) = 1 then show that a/c. 2

b) Find (5325, 492). 2

c) Define Fermat Numbers. 2

d) ( )
Prove that a 2 , b 2 = c 2 if (a, b) = c. 2

e) If a  b ( mod m ) then show that a n  bn ( mod m ) ,  n  N. 2

f) Find the remainder when 43289 is divided by 7. 2

g) Define ℐ(𝑛) &  ( n ) & calculate them for n = 18. 2

h) Define Pythagorean Triple. 2

**********

GUG/S/19/12015 2

You might also like