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 pigeon hole principle. CO3 K1 2 3

2. State principle of inclusion and exclusion. CO3 K1 2 3

Find the number of positive integers ≤ 2076 that are divisible by CO3 K2 2 3
3. 19 .
4. Express (1776)8 in base 10. CO3 K2 2 3

5. Find the consecutive integers < 100 that are composite numbers. CO3 K1 2 3

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

6. a) I) Find the number of positive integers ≤ 3000 divisible by CO3 K3 13 25
3, 5 or 7.

II) Use canonical decomposition to evaluate LCM of 1050

and 2574.
OR
b) I)Use Euclidean algorithm to find the GCD of (4076,1024). CO3 K3 13 25
Alsoexpress the GCD as a linear combination of the given
numbers.
II)Find the primes such that the digit in their decimal values
alternate between 0s and 1s,beginning with 1and ending in 1
a) Prove that the GCD of two positive integers a and b is a linear CO3 K3 13 25
7. combination of a and b.

OR
b) State and prove the Fundamental theorem of Arithmetic.. CO3 K3 13 25

a) Find the next two rows in the following number pattern and CO3 K3 14 25
8. conjucate a formula for nth row and prove it
1.9 + 2 = 11
12.9 + 3 = 111
123.9 + 4 = 1111
1234.9 + 5 = 11111
12345.9 + 6 = 111111
123456.9 + 7 = 1111111.

OR

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

 b) I) Prove that every integer 𝑛 ≥ 2 has a prime factor. CO3 K3 14 25
II) Prove that: (Euclid) There are infinitely many primes.

**********************************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