Define a subgroup and give one proper subgroup of

Show that the inverse of any element in a group G is unique.

Give an example of a group G with subgroups H, K such that is not a subgroup of G.

Find the inverse of 3 under the binary operation * defined in R by a * b =ab/3.

Find the left cosets of {[0],[3]} in the group (Z6, +6).

Give any two properties of cyclic group.

Give an example for a cyclic group along with its generator.

Let Z be a group of integers with binary operation * defined bya ∗ b = a + b − 2 for all a, b ∈ Z. Find the identity
element of the group (Z,∗).

Give an example of a ring which is not a field.

If a is a generator of a cyclic groupG, then show that a−1 is also a generator ofG.

If f(x) = 2x4 + 5x2 + 2 and g(x) = 6x2 + 4, then determine f(x) ·g(x) in Z7[x].

Determine all polynomials of degree 2 in Z2[x].

Find the roots for the function f(x) = x2 + 3x + 2 ∈ Z6[x].

Let F denote a field. What elements in are invertible with respect to polynomial multiplication?

Let F denote a field. Can (set of all polynomials over F) be a field? Why?
5 3 2
What is the remainder when f (x )=x +2 x + x +2 x+ 3∈ Z 5 [ x ] is divided by (x–1)?
3 2
What is the remainder when f (x )=2 x + x +2 x+3 ∈ Z 5 [ x ] is divided by (x–2)?

Give an example for an irreducible and reducible polynomial in Z2[x].

Define irreducible polynomial.

Determine whether is an irreducible polynomialover the binary field {0, 1}. Justify your answer?

Let p be a prime number, and a andb be integers. Show that if , then or .

Find the number of positive integers 2076, and divisible by 13.

Find the number of positive integers 2076, and divisible by neither 4 nor 5.

Find the number of positive integers ≤ 2076 that are divisible by 19.

Find the number of positive integers ≤ 3076 that are not divisible by 17.

Find the GCD of a+b, a2 – b2.

Find the positive integer a if [a, a+1] = 132.

Find the GCD of 168 and 180 using canonical decomposition.

Find the canonical decomposition of 2520.

Find the canonical decomposition of 2574.

Examine whether the linear Diophantine equation is solvable. Write the general solution if
solvable.

Determine whether the LDE 6x+8y = 25 is solvable.

When does the linear congruence ax ≡ b (mod m) has a unique solution?

Determine whether the LDE 2x+3y +4z = 5 is solvable.

When does the linear Diophantine equationax+by=c has a unique solution?

Find the remainder when 1! + 2! + ⋯ + 100! is divided by 15.

Find the remainder when 1! + 2! + ⋯ + 1000! is divided by 10.

Find the remainder when 1! + 2! + ⋯ + 1000! is divided by 12.

What is the remainderwhen331 is divided by 7?

Find the remainder when4117 is divided by 15.

Find the reminder when 22! is divided by 23.

State Euler’s theorem.

Find the reminder when 100! is divided by 101.

Find the reminder when 18! is divided by 19.

Find the reminder when 21! is divided by 23.

Define multiplicative function and give an example of a multiplicative function.

Find all the positive integers n that satisfy, φ(n) = 6.

Find the value of τ (n) and σ(n) for n = 29.

Ifn = 2k, then show that the value of the Euler phi function is φ(n) = n/2.

Find the value ofφ(6125), where φ is the Euler phi function.

11.A. Let G be the set of all rigid motions of an equilateral triangle. Identify the elements of G.
Show that it is a non-abelian group of order 6. (unit 1 Xerox page 1)
(ii) LetGbe a group with subgroups H and K. If |G|= 660, |K| = 66 and what are the
possible values for|H| (Xerox )

Let G be the set of all rigid motions of an equilateral triangle. Identify the elements of G. Show
that it is a non-abelian group of order 6.
(ii)State and prove Lagrange’s theorem.

Let . Show that is a group under matrix multiplication and is

isomorphic to a group under addition modulo 4.(unit 1 xerox page 5 problem 6)

et . Show that theabelian group under matrix multiplication is

isomorphic to the abelian group (G, .), where and. isthe ordinary multiplication.
(8) unit 1 xerox page 6 problem 7)

11 B Prove that is a ring on the set of rational numbers under the binary operations

for . (8) unit 1 class notes)

(ii) Find [25]–1 in Z72( unit 1 xerox page 14

i) Prove that Zn is a field if and only if n is a prime. (8)

(ii) Find [100]–1 in Z1009 unit 1 xerox page 13)
12.A. If has degreen ≥ 1, then prove that f(x) has at most n roots in F . (8)
If and find the remainder when
f ( x) is divide by g ¿)

Find the gcd of x4 + x3 + x + 1 andx3 + x2 + x + 1 in Z2[x].

Find the GCD of and in Q[x].

100 90 80 50
If f ( x )=x + x + x + x +1, g ( x )=x−1 and find the remainder when f(x) is
divide by g(x)

If f ( x )=2 x 4 +5 x 2+ 2, g ( x )=6 x 2+ 4 , then determine q(x) and r(x) in Z7[x], when f(x) is divided by
g(x)

12.B. Determine whether the polynomial is irreducible over the given fieldZ5

Determine whether the polynomial is irreducible over Z2

If R is a ring under usual addition and multiplication, show that ( R [ x ] ,+, × )is a ring of
polynomials over R

) Determine whether the polynomial is irreducible over the field Z3.

x 2 +x+4 in Z 11 [ x ] is irreducible over Z 11 .

Test whether the polynomial

Determine whether the polynomial is irreducible over the field Z5

Prove that a finite field Fhas order where p is a prime and .(

If (F,+, ·) is a field and char(F) >0, then prove that char(F) must be prime

.A. Prove that there are infinitely many primes. (8)

13

Prove that the gcd of the positive integers a and b is a linear combination of a and b
Prove that for every positive integer n there are n consecutive integers that are composite
numbers. Also find the six consecutive integers that are composite

13.B. Apply Euclidean algorithm, to compute (3076, 1976).Also, express the gcdas a linear
combination of the given numbers. (8)
ab
[a ,b]= .
If a and b are positive integers then prove that (a, b)

Apply Euclidean algorithm to express the gcd of 2076 and 1776 as a linear combination of
themselves

Use Euclidean algorithm, to compute (2024,1024). Also,express the GCD as a linear

combination of the given numbers

) State and prove the fundamental theorem of arithmetic

Apply Euclidean algorithm, to express the gcdof 1976 and 1776 as a linear combination of
themselves

14.A Twenty-three weary travelers entered the outskirts of a lush and beautiful forest. They found
63 equal heaps of plantains and seven single fruits, and divided them equally. Find the number of
fruits in each heap

Solve thelinear system

Find the general solution of the LDE

Obtain the general solution of the LDE 12x+18y = 30

Solve the system of linear congruences: and

Find the general solution of the LDE 6x+8y+12z = 10. (8)

Solve the linear system 3x + 4y ≡ 5( mod 7) 4x + 5y ≡ 6( mod 7).

Solve thelinear system and

14.b. State and prove Chinese remainder theorem. (8)

 ,
(ii) Using CRT, solve the linear system

Using CRT find the least positive integer that leaves the remainder 1 when divided by 3, 2 when
divided by 4 and 3 when divided by 5.

Solve the following system of congruences:

Solve the linear system

Using it find the least positive integer that leaves the remainder 2 when divided by 3, 4 when
divided by 5 and 5 when divided by 7

15 A

State and prove Wilson’s theorem. (8)

(ii) Using Euler’s theorem, find the remainder when 2451040 is divided by 18

State and prove Fermat’s little theorem.(8)

(ii)Using Euler’s theorem, find the remainder when 2451040 is divided by 18

State and prove Wilson’s theorem. (8)

(ii) Using Euler’s theorem, find the remainder when 245100 is divided by 18. (

State and prove Fermat’s little theorem. (8)

(ii) Find the remainder when 241947 is divided by 17

State and prove Wilson’s theorem. (8)

(ii) Find the remainder when 241947 is divided by 17

15 B

Define Euler’s phi function and prove that it is multiplicative. (8)

(ii) If is the canonical decomposition of a positive integer n, then derive a

formula to calculate the Euler’s phi function and compute

Define Euler’s phi function and prove that it is multiplicative. (8)

(ii) Let nbe a positive integer with canonical decomposition . Derive the formula
for evaluating Euler’s phi functionϕ(n) and hence, evaluate the samefor n = 6125.
Define Euler’s phi function and prove that it is multiplicative. (8)
(ii) Let be distinct primes and Evaluate and show that

Let n be a positive integer with canonical decomposition Derive the formula

for Tau and Sigma functions. Hence, evaluate and for

Prove thatEuler’s phi functionϕ is multiplicative. (8)

(ii) Compute and .(