Scribd
Upload
147 views2 pages

T. Y. B. Sc. (Sem. - V) Examination March - 2023 Mathematics: MTH - 506 Number Theory - I

The document is a mathematics exam paper on number theory containing 5 questions with multiple parts each. It covers topics like prime factorization, divisibility rules, congruences and solving linear Diophantine equations. Students are required to answer 10 out of the total 50 questions in the paper.

Uploaded by

Vishal Suthar
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
147 views2 pages

T. Y. B. Sc. (Sem. - V) Examination March - 2023 Mathematics: MTH - 506 Number Theory - I

The document is a mathematics exam paper on number theory containing 5 questions with multiple parts each. It covers topics like prime factorization, divisibility rules, congruences and solving linear Diophantine equations. Students are required to answer 10 out of the total 50 questions in the paper.

Uploaded by

Vishal Suthar
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

*RAN-2203000205023006*

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

RAN-2203000205023006
T. Y. B. Sc. (Sem. - V) Examination March - 2023
Mathematics : MTH - 506
Number Theory - I

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. (Sem. - V)
Name of the Subject :
 Mathematics : MTH - 506 Number Theory - I
Subject Code No.: 2203000205023006 Student’s Signature

(2) All questions are compulsory.


(3) Follow usual notations.
(4) Figures to the right indicate marks of the question.

Que 1: Answer Any Five from the following: (10)


(1) If gcd (a,b) = 3 then show that gcd (a/3, b/3) = 1.

(2) If a/c and b/c with gcd (a,b) = 1 then prove that ab/c.

(3) Solve: 81x + 6y = 29.

(4) Check whether the integer 509 is a prime or composite?

(5) Prove that the only prime of the form n3 – 1 is 7.

(6) Find the prime factorization of the integer 2022.

(7) For any integer a, prove that a4 ≡ 0 or 1 (mod5).

(8) Find the remainder when 4165 is divided by 7.


P0143

RAN-2203000205023006 ] [1] [ P.T.O. ]


Que 2: Answer any two questions: (10)
(1) For positive integers a and b prove that gcd (a,b) 1cm (a,b) = a.b.

(2) Find integers x and y such that gcd (741, 1079) = 741x +1079y.

(3) If a is odd integer, then prove that 32 | (a2 + 3) (a2 + 7).

Que 3: Answer any two questions: (10)


(1) If a is odd integer then show that (3a, 3a + 2) = 1.

(2) Determine all the solutions in the integers of the Diophantine


eqn. 123x + 360y = 99.

(3) Show that the linear Diophantine equation ax + by = c has a solution if


and only if d | c where d = gcd (a, b).

Que 4: Answer any two questions: (10)


(1) Prove that any composite number a will always have a prime divisor p
such that p < a .

(2) If p > q > 5 and p & q both are primes then show that 24 | p2 – q2.

(3) Prove that any prime of the form 3n + 1 is also of the form 6m + 1.

Que 5: Answer any two questions: (10)


(1) If a ≡ b (mod n) and c ≡ d (mod n) then prove that a + c ≡ b + d (mod n)
and ac ≡ bd (mod n).

(2) Find the reminder when 55555555 is divided by 9.

(3) Working modulo 9 or 11, find the missing digit x in the following
calculation :
1548 × 3520 = 5448x60.
P0143

RAN-2203000205023006 ] [2] [ 180 ]

You might also like