Reg. No.

Question Paper Code: 90348

B.E./B.Tech. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2019
Fifth Semester
Information Technology
MA 8551- ALGEBRA AND NUMBER THEORY
(Common to Computer Science and Engineering/Computer and Communication
Engineering)
(Regulations 2017)
Time: Three Hout
Maximum: 100 Marks
CH1
78 1Answer ALL questions
PART-A (10x2=20 Marks)
1. Define asubgroup and give one proper subgroup of (Z t).
2. Give an example for a cyclic
group along with its generator.
3. Find all the roots
of fx) =
x*+ 4x in
Z,,b).
4. Give an example for an irreducible and reducible polynomial in
Z,[x].
5. Find the number of
positive integer's s 3076 and not divisible by 17.
6. Using the canonical decomposition of 1050 and 2574, find their lem.
7. Determine whether the LDE 2x +3y + 4z= 5 is solvable.
8. What is the remainder when
33 is divided by 7?
9. State Fermat's little theorem.
10. Ifn=2, then show that the value of Euler's phi function
o(n) n/2.
=

PART-B (5x16-80 Marks)

11. a) i) Let G be the set of all rigid motions of a
elements of G. Show that it is a non-abelianequilateral triangle. Identify the
group of order 6.
ii) Let Gcbe
Ga with
groupare thesubgroups H andforK. If IGI 6 6660,
acn , what possible values |K| = 66
=
0 , |K| 66 and
and =

(OR) (8+8)
b) i) Prove that (Q, , o) is a ring on the set of rational numbers
under
operations x y =x+y+ 7, xoy=x+y+ (xy/7) for x, y e Q the binary
ii) Find [100) in Z,00s9
(8+8)
 90848

12. a) i) If f(x) e Fx] has

degree n 2 1, then prove that f(x) has at most n roots in F.
ii) Find the ged of x10 x-x +x+ x?-1 and
x5-x-x+1 in Q[x (8+8)
(OR)
b) Prove that a finite field
has order p', wherepis a prime and t e Z.
F
(16)
13. a) i) Prove that there
are infinitely
many primes.
ii) Prove that the gcd of the positive
a and b. integers a and b is a linear combination of
(8+8)
(OR)
b) i) Apply Euclidean algorithm to
express the gcd of 1976 and 1776 as a linear
combination of themselves.
ii) Prove that the product of gcd and lem of
any two positive integers a andbis
equal to their products.
(8+8)
14. a) i) Find the general solution of the LDE 15x +
21y 39. =

i) Solve the linear system.

bx +6y 10 (mod
(8+8)
=
13)
6x-7y=2 (mod 13)
(OR)
b) State and prove Chinese Remainder Theorem. Using it find the
least positive
integer that leaves the remainder 1 when divided 3, 2 when
by divided by 4 and 3
when divided by 5.
(16)
15. a) i) State and prove Wilson's theorem.
ii) Using Euler's theorem find the remainder when 2451040 is divided 18.
by (8+8)
(OR)
b) Let n be a positive integer with canonical
the formulae for Tau and Sigma functions. decomposition n= p p P. Derive
Hence evaluate c(n) and on) for
n= 1980.
(16)
C S H

CH-78
 Roll No.

PAPER CODE:
X10666
QUESTION
N O V E M B E R / D E C E M B E R
2020
EXAMINATIONS,
DEGREE
B.E./B.Tech. Fifth Semester
Engincering
Computer
Science and THEORY
-ALGEBRA AND NUMBER and
MA8551 Engineering
Communication
Computer and
(Common to Information Technology)

(Regulations 2017)
Answer ALL Questions Maximum Marks:100

(10x2-20 Marks)
Time: 3 Hours
PART-A
ab

operation * defined in R by a * b=
1. Find the inverse
of 3 under the binary
divisors are there in Z17.
zero
and proper
2. How many units reducible in C[u.
irreducible in Qand
polynomial that is
3. Given an example of a in Z7|o.
62 +4, then determine f(z) g(r)
2 4 + 5 2 + 2 and g(r) =

4. If f(r) =

principle.
5. State the pigeonhole
composite.
integers that
are
consecutive
6. Find six soloution?
mod m) has a unique
linear congruence
ar = b (
7. When does the
by 15.
remainder when 41 is divided
8. Find the
theorem.
9. State Wilson's
for n = 29.
value of r(n) and a(n)
10. Find the (5x16-80 Marks)
PART-B
with the binary operation a y
=
r +y-7,
(2, D, ©) is a ring (8)
Determine whether
11. (a) i) for all t, y E Z.
TOy=t +y- 3ry a } for all
only if, (ab)
=
and
G is abelian, if
For any group G,
prove that (8
ii)
a,bE G

(OR)
is prime.
(8)
and only if, n a
Prove that 2, is field, if
(b) (1) (8)
(i) Find[777|
in Z009
12. (a) ) State and prove the factor theorem and remainder theorem.
(8)
(ii) Find the remainder, when f(r) = z100 - 90+0 -a50+1 is divided by g(T) = t-1
in Zalr
(8)

(OR)
(b) ) If (F, +,) is a field and char(F) > 0, then prove that char(F) must be prime. (8)
(ii) Find the ged of r + r' +r +1 and rs +r +r +1 in Z2|z).
(8)
13. (a) ) Find the number of positive integers3000 and divisible by 3, 5 or 7. (8)
(ii) Apply Euclidean algorithm to express the gcd of 2076 and 1776 as a linear combi-
nation of themselves.
(8)

(OR)
(b) i) Prove that there are infinitely many primes. (8)
(ii) State and prove the fundamental theorem of arithmetic.
(8)
14. (a) i) Find the general solution of the linear Diophantine equation 6z -+8y+12z =
10. (8)

(ii) Prove that no prime of the form 4n +3 can be expressed as the sum of two
squares.
(8)

(OR)
(b) i) Solve r E 2 mod 5), z = 3( mod 7) using OChinese remainder theorem.
(8)
3r 5( mod 7)
(ii) Solve the linear system A +4y
=E

4r +5y = 6( mod 7) (8)

15. (a) (i) State and prove Fermat's little theorem

(8)
ii) Let n be a positive integer with canonical decomposition n =p ..p. Derive
the formula for evaluating Euler's phi function o(n) and hence, evaluate the same
for n = 6125.
(8)

(OR)
(b) (i) Solve the linear congruence 25r = 13 ( mod 18). (8)
(ii) Prove that tau and sigma functions are multiplicative. (8)

* * * * **