Reg. No.

Vel Tech High Tech

Dr.Rangarajan Dr.Sakunthala Engineering College
An Autonomous Institution
CONTINUOUS INTERNAL ASSESSMENT – III
Common to CSE & IT
Fifth Semester
MA8551- Algebra and Number Theory
(Regulations 2017)
Date: 03.11.2022 Time: 90 Minutes Max. Marks: 50

CO3: To understand the basic concepts in Number theory.

PART-A (5 x 2 = 10 Marks) CO.No. K.No. Marks Time

1. State divisible algorithm. CO3 K1 2 3

2. Define Greatest common divisor. CO3 K1 2 3

Express (1976)16 in base 10 and express (2076)10 as hexadecimal CO3 K2 2 3

3.
4. Express (10110)2 in base 10. CO3 K1 2 3

5. Find the six consecutive integers that are composite CO3 K1 2 3

PART - B (13+13+14 = 40 Marks)

6. a) I) Find the number of positive integers ≤ 2076 divisible by CO3 K3 13 25
neither 4 nor 5.
II) Let 𝑏 be an integer ≥ 2. Suppose (𝑏 + 1) integers are
randomly selected, Then prove that the difference of two of
them is divisible by 𝑏.
OR
b) I) Use Euclidean algorithm to find the GCD of (2076, 1776). CO3 K3 13 25
Alsoexpress the GCD as a linear combination of the given
numbers
𝑎 𝑏
II) Let gcd (𝑎, 𝑏) = 𝑑 . Then prove that (i) gcd (𝑑 , 𝑑 ) = 1 ; (ii)
gcd (𝑎, , 𝑎 − 𝑏) = 𝑑 ;
a) Find the number of integers between 1 to 250 that are not CO3 K3 13 25
7.. divisible by any of the integers 2, 3, 5 and 7.

OR
b) Find the next two rows in the following number pattern and CO3 K3 13 25
conjucate a formula for 𝑛 𝑡ℎ row and prove it
9.9 + 7 = 88
98.9 + 6 = 888 .
987.9 + 5 = 8888
9876.9 + 4 = 88888
98765.9 + 3 = 888888 .

a) (I) Prove that every integer 𝑛 ≥ 2 has a prime factor. CO3 K3 14 25

8.
(II) Prove that: (Euclid) There are infinitely many primes.
OR

With reference to NBA-SAR Guideline: Criteria No. 2.2.2

 b) State and prove the Fundamental Theorem of Arithmetic. CO3 K3 14 25

**********************************ALL THE BEST**********************************

K1 – Remember; K2 – Understand; K3 – Apply; K4 – Analyse; K5 – Evaluate; K6 - Create

With reference to NBA-SAR Guideline: Criteria No. 2.2.2