Roll No. Total No. of Pages : 02
Total No. of Questions : 07
--- Content provided by FirstRanker.com ---
B.Sc.(Computer Science) (2013 & Onwards) (Sem.-4)
NUMBER THEORY
Subject Code : BCS-401
M.Code : 72317
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and students have to attempt any FOUR questions.
SECTION-A
- Answer the followings in short :
- Find G.C.D. 0f (49,210,350).
- Show that n is odd iff n = I(mod2).
- Give an example to show that if ab’= 0(mod m), then a# 0(mod m) and b= 0 (mod m)
- Solve the linear congruence-:9x = 21(mod 30).
- State Euclidean algorithm.
- State Euler’s theorem.
- State Wilson’s theorem.
- Define Euler phi function.
- Calculate the value of ¢ (360).
- For n> 2, ¢ (n) is an even integer.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- Prove that the numbers of primes are infinite.
- Find values of x and y to satisfy 71x — 50y = 1.
- State and prove Fundamental theorem of Arithmetic.
- State and prove Chinese remainder theorem.
- State and prove Mobius inversion formula.
- State and prove Fermat’s theorem.
--- Content provided by FirstRanker.com ---
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B-Sc CS-IT 2020 March Previous Question Papers