A V S COLLEGE OF TECHNOLOGY, Salem-636106

B.E Model Examination -II

Fifth Semester
Regulation-2017

Dept: Computer Science and Engineering Date:

Subject Code & Name: MA8551 & Algebra and Number Theory Duration: 3 Hours

Part-A (10X2=20)
Answer all the questions:

1. Why is the set Z not a group under subtraction?

2. Define Isomorphism.

3. State division algorithm.

4. If f  x  , g  x   Z 2  x  , f  x   x  x  x  x  1, g  x   x  1 .
100 90 80 50

5. Determine whether 1601 is a prime number.

6. Every odd integers is of the form 4 k+1 or 4 k +3.

7. Determine whether the LED 2x + 3y + 4z = 5 is solvable. (Nov/Dec-19)

8. Using casting out nines, find the missing non-zero digit d in each computation. 7167 – 1776 = 53d1

9. If p be any odd prime and a any non-negative integer then 1 +2 + …+ ( p−1 ) ≡−1(mod p).
p−1 p−1 p −1

n
φ( n)=
10. If n=2 , then
k 2 (N/D-19)

Part-B (5X16=80)

Answer all the questions.

11. a) i) If (G, *) is an abelian group , show that (i) (a * b) 2 = a2 * b2 , (ii) (a * b)-1 = a-1 * b-1. (N/D-10)

ii) State and Prove Lagrange’s theorem. (Apr/May-16, 17, Nov/Dec-13, 16)

(OR)

b) i) Show that f : ( R , )  ( R, ) where f ( x)  log x for all x  R is an isomorphism.


1 0 , −1 0 , 1 0 , −1 0
ii) Prove that G= {[ ] [
0 1 0 1 0 −1 ][
0 −1 ][ ]} forms an abelian group under matrix

multiplication. (Nov/Dec-15)

12. a) i) Let ( F ,+ ,∙ ) be a field. If char (F )> 0, then char (F ) must be prime.

t
ii) A finite field F has order p, Where p is a prime and t∈Z
+
. (Nov/Dec-19)

(OR)
 b) Use the Euclidean algorithm for polynomials to find the gcd of each pair of polynomials, over the

designated field F. Then write the gcd as s ( x ) f ( x ) +t ( x ) g ( x), where s ( x ) , t ( x ) ∈ F [x ].

f ( x )=x 2 + x−2 , g ( x )=x 5−x 4+ x3 + x 2−x−1 in Q[ x ]

13. a) i) State and Prove Base –b representation.

ii) Compute the number of primes ¿ n for each value of n given by using π (n) formula of 131,

100

and 64.

(OR)

b) i) Apply the Euclidean algorithm to express the gcd of 1976 and 1776 as a linear combination of

themselves. (Nov/Dec-19)

10n−9 n−1
ii) Show that =123 … …(n−1), where 2 ≤n ≤ 9.
81
14. a) i) The remainder 2 when divided by 5, 4 when divided by 6, 5 when divided by 11 and 6 when

divided by 13.

ii) State and prove The Chinese Remainder Theorem. (Nov/Dec-19)

(OR)

b) i) Using the method of elimination, solve the linear system 2 x+3 y ≡ 4(mod 13) ,

3 x+ 4 y ≡5(mod 13).
ii) Compute the remainder when 3247 is divided by 25.

15.
e1 e2 ek
a) i) Let n be a positive integer with canonical decomposition n= p1 p2 … pk . Derive the formula

for Tau and Sigma functions. Hence evaluate τ (n) and σ (n) for n = 1980. (Nov/Dec-19)

ii) Define Euler’s Phi function and prove that it is multiplicative.

(OR)

b) i) Using Euler’s theorem find the remainder when 2451040 is divided by 18. (Nov/Dec-19)

ii) If p is a prime and e be any positive integer then prove that ϕ ( pe ) =p e −p e−1 . Also show that

ϕ ( n )=n/ 2, when n = 2k.