*RAN-2003000205020036*

R A N - 2 0 0 3 0 0 0 2 0 5 0 2 0 0 3 6

RAN-2003000205020036
T. Y. B.Sc. (Semester - V) Examination
January - 2021
Mathematics
MTH - 506 : Number Theory - I (Old & New)

Time: 2 Hours ] [ Total Marks: 50

k|Q“p : / Instructions
(1)
“uQ¡ v$ip®h¡g  r“ip“uhpmu rhNsp¡ DÑfhlu ‘f Ahíe gMhu. Seat No.:
Fill up strictly the details of  signs on your answer book
Name of the Examination:
 T. Y. B.Sc. (Semester - V)
Name of the Subject :
 Mathematics : MTH - 506 : Number Theory - I (Old & New)
Subject Code No.: 2003000205020036 Student’s Signature

(2) Digits to the right indicates marks of the question.

(3) Follow the usual notations.

Q-1 Answer any FIVE questions: (10)

(1) Given integers a and b, not both of them zero then, show that
gcd (2a – 3b,4a – 5b) divide b ; hence gcd (2a + 3,4a + 5) = 1
(2) If p > 5 is a prime, Prove that p2 + 2 is composite.
(3) Prove that Product of any three consecutive integers is divisible by 3.
(4) Give an example of CRS modulo 9.
(5) Prove that for any integer a, a3 ≡ 0, 1 or 6 (mod 7).
(6) Find 1cm (306, 357).
(7) Solve: 8x + 18y = 9.
(8) lf N = 123x7 is divisible by 9 then find x.
P4457

RAN-2003000205020036 ] [ 1 ] [ P.T.O. ]
Q–2 Answer any two questions : (10)
(1) Given integers a and b, with b > 0, show that there exists
integers q and r such that a = bq + r ; 0 < r < b.
(2) Prove that product of four consecutive integers is 1 less than a perfect
square.
(3) Find the integers x and y such that gcd (272, 1479) = 272x + 1479y.

Q–3 Answer any two questions : (10)

(1) If p is a prime then prove that p is an irrational number.
(2) Determine the all positive solutions of the Diophantine equation
123x + 360y = 99.
(3) Prove that for any Composite integer n > 1 there exist a prime divisor
p of n such that p < n .

Q-4 Answer any two questions : (10)

(1) For arbitrary integers a and b show that a ≡ b(mod n) iff a and b leaves
the same remainder when divided by n.
(2) Prove that there are infinite number of primes.
(3) Find the remainder when 55555555 is divided by 9.

Q–5 Answer any two questions : (10)

(1) Let N = ambm + am – 1bm–1 + am – 2bm–2 + – – – + a1b1 + a0, be the representation
of the positive integer N, with 0 < ak < b – 1, and
T = a0 + a1 + a2 + – – – + am – 1 + am. Then Prove that b – 1 | N if and only
if b – l | T.
8
(2) Find the last two digits of 98 .
(3) Prove that the product of any set of n consecutive integers is divisible by n.
P4457

RAN-2003000205020036 ] [ 2 ] [ 860 ]