Anna University Exams Nov / Dec 2019 – Regulation 2017

Rejinpaul.com Unique Important Questions – 5th Semester BE/BTECH

MA8551 ALGEBRA AND NUMBER THEORY
UNIT – I
PART – A
1. Prove that the identity of a subgroup is the same as that of the group.
2. Define a Field.
3. If ‘a’ is a generator of a cyclic group G, then shows that is also a generator of G.
4. Give an example of a ring which is not a field.
5. Show that every cyclic group is abelian.
6. Define ring and give an example.
PART – B
1. State and prove Lagrange’s theorem.
2. Prove that any group of prime order is cyclic.
3. Prove that every subgroup of a cyclic group is cyclic.
4. Prove that 𝒛𝒏 is field iff n is prime.
5. Prove that 𝒛𝒏 is an integral domain iff n is prime.
6. Let f:G → H be a group homomorphism onto H.If G is abelian then prove that H is
abelian.
7. Prove that𝒛𝒏 , a is a unit iffgcd(a,n)=1.
8. Find[𝟏𝟎𝟎]−𝟏 in the ring 𝒁𝟏𝟎𝟎𝟗 .
9. Prove that necessary and sufficient conditions for a non empty subset of a group
becomes a subgroup.
10. A ring R has no zero divisors iff cancellation law is valid in R.
UNIT – II
PART – A
1. What is the remainder when f ( x) = x 5 + 2 x 3 + x 2 + 2 x + 3  Z 5 [ x] is divided by (x –
1)?
2. Let F be a field. Can F[x] be a field? Why?
3. What is the g.c.d of f ( x) = x 4 + x 3 + 1 and g ( x) = x2 + x + 1 in Z2[x].
4. Find the remainder when f ( x) = 3x5 − 8x4 + x3 − x2 + 4 x − 7 is divided by
g ( x) = x + 9 in Z11[x].
5. Is f ( x) = x 2 + 1 in Z[x] irreducible over Z.
PART - B
𝟑 𝟐
1. Find all the roots of f(x)=𝒙 +5𝒙 +2x+6 in 𝒛𝟕 (x).
2. Let R be a ring.Prove that (R(x),+,.) is a ring.
3. Consider f(x)=3𝒙𝟐 +4x+2 and g(x)= 𝟔𝒙𝟒 + 𝟒𝒙𝟑 + 𝟓𝒙𝟐 + 𝟑𝐱 + 𝟏 in 𝒛𝟕 (x). Find q(x)
and r(x) divided by g(x).
4. If R is an integral domain, then prove that deg (f(x).g(x)) =deg f(x)+deg g(x).
5. Prove that characteristic of a field (F,+,.) is either 0 or a prime number.
6. Prove that R(x) is an integral domain iff R is an integral domain.
7. If f(x)𝝐𝑭(𝒙)𝒊𝒔 𝒐𝒇𝒅𝒆𝒈𝒓𝒆𝒆 n≥1,then Prove that f(x) has atmost n roots in F.
8. Prove that the number of elements of a field is 𝒑𝒏 ,where p is a prime number and
n is a positive integer.
 UNIT – III
PART – A
1. Find the gcd of 68 and 80 using the canonical decomposition.
2. Find the positive integer a if [a, a + 1] = 132.
3. State the division algorithm for two integers a and b, where b>0.
4. Express (1776)8 as a decimal number.
5. If ab = 156, and a and b are relatively prime find [a, b].
6. What are the digits and symbols used in the hexadecimal representation?
PART – B
1. Find the number of positive integers  1000 and divisible by 3, 4 or 5.
2. State and prove Fundamental theorem of arithmetic.
3. Use recursion to evaluate (18, 30, 60, 75, 132) .
4. Prove that “Let a and b be two positive integers such that a = qb + r,0  r  b . Then
the gcd(a,b) = the gcd (b,r)”.
5. State and prove division algorithm.
6. Use the Euclidean algorithm to express the gcd of 4076 and 1024 as a linear
combination of them.
7. Prove that there are infinitely many primes.
8. Prove that gcd of two +ve integers a and b is a linear combination of a & b.
9. Observing the pattern of numbers write down the formula for the nth row and
prove it.
1.8+1=9
12.8+2=98
123.8+3=987
1234.8+4=9876. . .
UNIT – IV
PART – A
1. Is the linear Diophantine equation 6 x + 8 y = 25 solvable?.
2. Find the inverse of 7 modulo 26.
3. Find the last digit in 355.
4. Examine whether the linear Diophantine equation 12 x + 16 y = 18 is solvable.
5. Find the remainder when 297 is divided by 13.
PART – B
1. Find the remainder when 1!+2!+3!+4!+...... + 300! is divided by 13.
2. Solve the system x  1(mod 3) , x  2(mod 4) , x  3(mod 5) .
3. Determine whether the congruence 12x  48(mod 18) is solvable and also find all
the solutions if Solvable.
4. Prove that “The linear Diophantine equation ax + by = c is solvable if and only if
d \ c, where d = (a, b). If x0 , y0 is a particular solution of the linear Diophantine
b a
equation, then all its solutions are given by x = x0 +  t and y = y0 −  t ,
d  d 
where t is any integer.
5. Determine if the LDE 2 x + 4 y − 5z = 11 is solvable? If so find the general solution.
6. State and prove Chinese Remainder theorem.
 7. Determine all the incongruence solutions 48x  144(mod 84) .
UNIT – V
PART – A
1. Verify Wilson’s theorem ( p − 1)!  −1(mod p) if p = 7.
2. Find  (n)and (n) if n=30.
3. Verify Wilson’s theorem ( p − 1)!  −1(mod p) if p = 13.
4. Find  (n)and (n) if n=16.
PART – B
1. State and prove Fermet’s theorem.
2. Find the positive integers n such that  (n) = 6 .
3. Find the last two digits of 2731961 .
4. Prove that Let f be a multiplicative function and n be a +ve integer with canonical

decomposition n = p1 1 . p2 2 ..... pk k . Then  (n) = n1 − 1 1 − 1 .....1 − 1 

a a a

 p 1  p 2   pk 
5. State and prove Wilson’s theorem.
6. Provethat ‘m’ be a positive and ‘a’ be any integer such that (a, m)=1. Then
a ( m)  1(mod m) .
7. Provethat “Euler function  is multiplicative”.
8. Find (i)  (1105) and  (7!)

Questions Are Expected for University Exams This May or may Not Be Asked for Exams
Please do not Copy (or) Republish This Questions, Students if You Find the Same Questions in
Other Sources, Kindly report us to rejinpaulteam@gmail.com