Roll No.

: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
Amrita Vishwa Vidyapeetham
Amrita School of Computing, Chennai
B.Tech. Degree Examinations – June, 2023
I/II Semester
Computer Science Engineering- Cyber Security (CSE-CYS)
Periodical- 2 Exam
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. Show that the set 𝑆 = {1, 2, 3} under multiplication modulo 4 is not a group but that set 𝐺 =
{1, 2, 3, 4} under multiplication modulo 5 is a group. [7] [BTL-3] [CO3]
2. Let 𝐺 be an abelian group and 𝐻 and 𝐾 be subgroups of group 𝐺, then show that 𝐻𝐾 =
{ℎ𝑘 | ℎ ∈ 𝐻, 𝑘 ∈ 𝐾} is a subgroup of 𝐺. [7] [BTL-4] [CO3]
3. Show that the set 𝑆 = {0, 1, 2, 3, 4} is a ring with respect to operation addition modulo 5
and multiplication modulo 5. [7] [BTL-3] [CO3]
𝑎 0
4. Show that the set {[ ] | 𝑎, 𝑏 ∈ 𝑍} of diagonal matrices is a subring of the ring of all
0 𝑏
2 × 2 matrices over set of integers 𝑍. [7] [BTL-4] [CO4]

Page 1 of 2
5. Let 𝑸 be the field of rational numbers, then show that 𝑸(√2, √3) = 𝑸(√2 + √3).
[8] [BTL-4] [CO4]
3
6. (a) Show that the polynomial 𝑓(𝑥) = 𝑥 + 3𝑥 + 2 is an irreducible over 𝒁5 .
[3] [BTL-4] [CO4]
4 2
(b) Prove or disprove the polynomial 𝑓(𝑥) = 𝑥 + 3𝑥 − 7𝑥 + 1 is a reducible polynomial
over 𝑸[𝑥]. [4] [BTL-4] [CO4]
7. (a) Show that the number 𝑝 = 31 is a prime number by using primality test (Fermat’s Little
theorem). [3] [BTL-4] [CO5]
(b) Show that the number 𝑛 = 61 is a prime number by using primality test (Rabin-Miller
test). [4] [BTL-4] [CO5]

Page 2 of 2