Roll No.

: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
Amrita Vishwa Vidyapeetham
Amrita School of Computing, Chennai
B.Tech. Degree Examinations – April, 2023
I/II Semester
Computer Science Engineering- Cyber Security (CSE-CYS)
20MAT112- Number Theory and Algebra
Time: Two Hours Maximum: 50 Marks

Course Outcomes (COs)

COs Course Outcomes

CO01 To understand basic definitions in number theory like, prime numbers, GCD and Euclidian
algorithm.

CO02 To understand and solve problems in prime factorization theorem, Fermat’s theorems and
Chinese remainder theorem

CO03 To understand the basic concepts of groups and subgroups and their simple properties.

CO04 To understand basic concepts of rings,subrings and quotient rings.

CO05 Familiar basic results in Fields and polynomial rings

Note:

1. All the questions are compulsory and descriptive.

2. Notations/symbols have their usual meaning.
3. While answering, justify your steps. Just writing the final answer will receive no credit.

----------------------------------------------------------------------------------------------------------------------------------------------

1. (a) Apply the Euclidean algorithm to find the greatest common divisor (gcd) of 4076 and
1024. [4] [BTL-3] [CO1]
(b) Use recursion to evaluate the greatest common divisor (gcd) of 18, 30, 60, 75, and 132.
[3] [BTL-3] [CO1]
1947
2. Find the remainder when 24 is divided by 17 using Euler’s theorem and verify the
answer using Fermat’s theorem. [7] [BTL-4] [CO2]
3. Solve the following system using Chinese Remainder theorem
𝑥 ≡ 2 (mod 3), 𝑥 ≡ 4 (mod 5), 𝑥 ≡ 5 (mod 7) [7] [BTL-4] [CO2]
4. Let 𝑚 be an integer with 𝑚 > 1. Show that the relation 𝑅 = {(𝑎, 𝑏)| 𝑎 ≡ 𝑏 (mod 𝑚)} is an
equivalence relation on the set of integers Z. [7] [BTL-4] [CO2]

Page 1 of 2
5. (a) Prove or disprove the number of positive integers less than or equal to 4000 and
divisible by 4, 5 or 9 is 1867. [4] [BTL-3] [CO1]
(b) Show that 561 is a Carmichael number. [3] [BTL-3] [CO1]
1199
6. (a) Write a finite simple continued fraction of the rational number 199 using Euclidean
algorithm. [3] [BTL-3] [CO1]
(b) Represent the continued fraction [5; 4,3,2,1] as a rational number. [4] [BTL-3] [CO1]
7. (a) Find all the quadratic and non-quadratic residues of an integer 17. [3] [BTL-4] [CO2]
(b) Solve the quadratic congruence 3𝑥 2 − 4𝑥 + 7 ≡ 0 (mod 13). [5] [BTL-4] [CO2]

Page 2 of 2