Part – B

UNIT I

Vector space( topics)

1 Show that set of all mxn matrices with real entries. Show that V is a vector space
over with respect to usual matrix addition done entry wise and usual scalar
multiplication done entry wise. Verify all the conditions of a vector space [ Also
learn all 2x2 matrices with real entries where m=2, n=2]

2
Show that is a vector space over F with
respect to addition and scalar multiplication defined component wise.

3
Let . Define addition component wise and scalar
multiplication by .Test Whether V is a vector space
over R.

Linear independent or linear dependent / linear combination (topic)

1 (i)Is the vectors (2, -5, 3) in V3(R) is linear combination of (1,-3,2),

(1, (2,-4,-1) and
(1,-5,7) .
(ii)Determine whether the vectors (1,3,2), (3,-2,1)
(3, and (1,-6,-5) in R3 are linearly
dependent over R.

2 (i)Can we able to express (3,7,-4)

4) as a linear combination of (1,2,3), (2,3,7) and
(3,5,6).
(ii)Show that the vectors (1,0,0), (0,1,0), (0,0,1) belonging to R3 are linearly
independent over R.

3 (i)Show that the vectors (3,0,-3), (--1,1,2), (4,2,-2), (2,1,1) are linearly dependent
over R.
(ii) Is the vectors (2, -5, 3) in V3(R) is linear combination of (1,-3,2),
(1, (2,-4,-1) and
(1,-5,7)

4 (i)Determine whether (1,3,-1,4), 1,4), (3,8,-5,7),

(3,8, (2,9,4,23) are linearly independent or
not.
(ii)Is the vectors (2, -5, 3) in V3(R) is linear combination of (1,-3,2), (2,-4,-1) and
(1,-5,7)

5 (i)Let V=P3(x) be a vector space of polynomials of degree ≤ 3 together with zero

polynomial over R. Check whether x3-3x2+5x+1, x3-x2+8x+2, 2x3-4x2+9x+5 are
linearly independent or not.
Is the vectors (2, -5,
5, 3) in V3(R) is linear combination of (1,-3,2),
(1, (2,-4,-1) and
(1,-5,7) (8)

6 (i)Determine whether (1,-2,,4,1),

2,,4,1), (2,1,0,-3),
(2,1,0, (1,-6,1,4) are linearly independent or
not.
(ii)Is the vectors (2, -5, 3) in V3(R) is linear combination of (1,-3,2),
(1, (2,-4,-1) and
(1,-5,7)
7 Show that the polynomials
2 x 3 − 2 x 2 + 12 x − 6 is linear combinatio n of x 3 − 2 x 2 − 5 x − 3 and 3 x 3 − 2 x 2 + 7 x + 8

Subspaces and vector spaces theorems and properties

1 Prove that the union of two subspaces of a vector space V over F is a subspace of
V if and only if one is contained in the other.

2 If V1 and V2 are 2 vector spaces. Then prove the condition for V1 ∪ V2 to be

vector space.

3 (i)A non-empty subset W of a vector space V(F) is a subspace of V if and

only if ∀α , β ∈ W  α + β ∈ W .(ii )∀a ∈ F , α ∈ W , (8)
(ii) If V is a vector space over F then show that
(a) a0 = 0 for α ∈F, (b) (-a)α = a (-α) = -(aα ) for α∈V, a∈F .
(c) If α ≠ 0,then aα = 0 implies that a = 0. (8)

UNIT II
Linear Transformations

1 dV
(i)Check whether the transformation D : V → V defined by D (V ) = for all
dx
v ∈ V where V=P(x) linear or not.
(ii)Let U and V be two vector spaces over the field F. If T : U → V be a linear
transformation. Then show that (i) T(O)=O (ii) T ( −α ) = − T (α ) (iii) T (α − β ) =
T (α ) − T ( β ) for any α , β ∈ V

2 x
(i)Check whether the transformation I : V → V defined by I (V ) = vdx for all 
0

v ∈ V where V=P(x) linear or not.

(ii) Let U and V be two vector spaces over the field F. If T : U → V be a linear
transformation. Then show that R(T) is a subspace of V.

(i)Let T : V3 ( R) → V2 ( R ) given by T ( a, b, c ) = ( a + b,2c − a ). Find the matrix

3
representation of T with respect to standard basis.
(ii) Show that Nulity of T is subspace of U.

(i)Let T : R → R given by T ( x, y , z ) = ( x + y ,2 z − x ). Find the matrix

4 3 2

representation of T with respect to standard basis.

(ii) Show that kernel of T is subspace of U.

5 Let T : V3 ( R) → V4 ( R ) given by T (a , b, c ) = ( a + b + c, 2 a + z , 2b − c, 6b ). Find

the matrix representation of T with respect to standard basis.

Dimension theorem

1 Verify dimension theorem for T : R 2 → R 3 defined by

 T (a1 , a 2 ) = (a1 + a 2 ,0, 2a1 − a 2 )

2 Verify dimension theorem for T : R 3 → R 2 defined by

T ( x, y , z ) = ( 2 x − y , 3 z )

3 Verify dimension theorem for T : R 3 → R 2 defined by T ( x, y , z ) = ( x − y , 2 z )

4 Verify dimension theorem for T : R 3 → R 3 defined by

T ( x , y , z ) = ( x + 2 y − z , y + z , x + y − 2z )

5 Verify dimension theorem for T : R 3 → R 3 defined by

T ( a, b, c ) = ( a + 2b − c, b + c, a + b − 2c )

Diagonalise using orthogonal transformation

1  1 1 3
 
Test whether the matrix  1 5 1  is diagonalizable, if so find the modal matrix.
 3 1 1
 

2  8 −6 2 
 
Diagonalise the matrix A=  − 6 7 − 4  by means of orthogonal
 2 −4 3 
 
transformation.

3  6 −2 2 
 
Diagonalise the matrix A=  − 2 3 − 1 by means of orthogonal
 2 −1 3 
 
transformation.

4 3 1 1 
 
Diagonalise the matrix A=  1 3 − 1 by means of orthogonal transformation.
 1 −1 3 
 

5  2 1 −1
 
Diagonalise the matrix A=  1 1 − 2  by means of orthogonal
 −1 − 2 1 
 
transformation

6  7 −2 0 
 
Diagonalise the matrix A=  − 2 6 − 2  by means of orthogonal reduction.
 0 −2 5 
 

7
Let T be a linear operator on ܲଶ(R) given by . Find
the matrix of T in an ordered basis B such that matrix of is diagonalizable.
8 State and prove Dimension theorem.

Nullity Theorem based problems

1 State and prove Sylvesters law.

2 If U and V are vector spaces over the field F. Let T : U → V be linear

transformation. If U is of finite dimensional the rank(T)+ Nulity of (T)=dimension
of U (16)

UNIT III

GCD, division algorithm, fundamental theorem of arithmetic

1 (i) State and prove Fundamental theorem of arithmetic.

(ii) Prove that product of gcd and lcm of any two positive integers is equal
to product of integers.

2 (i) Let a and b be positive integers. Show that there exit integers m and n
such that ma + nb = ( a , b ).
(ii) Use Euclidean algorithm to find the GCD of (4076, 1024). Also express
the GCD as a linear combination of the given numbers.

3 (i) Prove that the GCD of two positive integers a and b is a linear
combination of a and b.
(ii) Use Euclidean algorithm to evaluate the GCD of (3076, 1976). Also
express the GCD as a linear combination of the given numbers.

4 (i) Let a and b be positive integers. Show that there exit integers m and n
such that ma + nb = gcd( a , b ).
(ii) Use Euclidean algorithm to find the GCD of (2024, 1024). Also express
the GCD as a linear combination of the given numbers.

5 (i) Prove that every positive integers ≥ 2 is either prime or product of primes
with unique factorization.
(ii) Prove that product of gcd and lcm of any two positive integers is equal
to product of integers.

6 (i)State and prove division algorithm for integers.

(iii) Using gcd(252, 360), compute [252, 360].

7 (i) Let a be any integer and b be a positive integer. Show that there exist
unique integers q and r such that a = bq + r , where 0 ≤ r < b. (10)
(ii) Apply the Euclidean algorithm to find (1050, 2574). Hence find their
lcm. (6)

8 (i) State and prove Fundamental theorem of arithmetic.

(ii) State and prove Euclidean algorithm.
9 (i) Prove that no primes of the form 4n + 3 cannot be expressed as sum of
two squares.
(ii) Using (1050, 2574), compute [1050, 2574].

10 (i) If a and b are relatively prime and if a/bc then prove a/c.
(ii) Prove Euclid theorem.

11 Using canonical decompositions of 1050 and 2574, find their gcd. Hence
compute their lcm.

12 (i)Prove that if a and b are 2 positive integers and r is the remainder when a
is divided by b then gcd(a, b) = gcd(b, r).
(ii) Prove that any two positive integers a and b are relatively prime if and
only if [a, b] =ab.

Mathematical inductions, principle of inclusion and exclusion

1 (i) Find the number of positive integers ≤ 3000 and divisible by 3, 5, or 7.

(ii) Prove by induction that 2 n 3 + 3n 2 + n is divisible by 6 for all integers n ≥
0.

2 (i) Find the number of positive integers in the range 1976 through 3776 that
are divisible by 13.
(ii) For any positive integer, Prove that 8n + 3and 5n + 2 are relatively
prime.

3 (i) Find the number of positive integers less than or equal to 3000 and
divisible by 3, 5, or 7.
(ii) Using recursion evaluate (18, 30, 60, 75, 132).

4 (i) Find the number of integers from 1 to 250 that are divisible by any of the
integers 2,3,5,7.
(ii) Using recursion evaluate (12, 36, 60, 72, 108).

Theorems and properties based on prime number and composite

number

1 i) Prove that there are infinitely many primes.

(ii) Prove that for every positive integer n there are n consecutive integers
that are composite numbers.

2 (i)Two positive integers a and b are relatively prime iff there exist
α and β such that αa + β b = 1.
(ii) Prove that every composite number has a prime factor ≤ n .

3 (i) Prove that if sum of cubes of three consecutive integers is k3 the prove
that 3 divides k.
 (ii) Find six consecutive integers that are composite numbers.

4 (i) If a/c & b/c and gcd (a, b) =1 then prove that ab/c. (8)
(ii) Prove that two positive integers are relatively prime iff their gcd is 1.

5 (i) Prove that (a, a-b)=1 if and only if (a, b)=1.

UNIT IV
LDE theorem and problems

1 Show that the linear Diophantine equation ax + by = c is solvable if and

only if d divides c, where d = (a, b). If x0 and y0 is a solution of the LDE,
then all its solution are given by x = x 0 + b t , and y = y 0 − a t , where t is an
d d
arbitrary integer.

2 Prove that the LDE ax + by = c is solvable if and only if d|c where d =

gcd(a, b). Further obtain the general solution of 15x+21y = 39.

3 State and prove the necessary and sufficient condition for LDE to be
solvable.

4 Prove that the LDE ax + by = c is solvable if and only if d|c where d =

gcd(a, b). Further obtain the general solution of 6x+8y+12z = 10.

5 Show that the linear Diophantine equation ax + by = c is solvable if and

only if (a, b) divides c. Further obtain the general solution of 12x+18y = 30.

Chinese remainder theorem & problems- iteration method

(congruence)

1 (i)State and prove Chinese remainder theorem.

(ii) Solve the linear system 5 x + 6 y ≡ 10(mod 13) 6 x − 7 y ≡ 2(mod 13).

2 (i)State and prove Chinese remainder theorem.

(ii) Solve the system of linear congruences: x + 3 y ≡ 3 (mod 11) and
5 x + y ≡ 5(mod 11).

3 (i) Using CRT, solve the linear system x ≡ 2 (mod 3) x ≡ 4(mod 5)

x ≡ 5(m od 7 ).

(ii) Solve the following system of linear congruences:

3 x + 4 y ≡ 5(mod 7 ) 4 x + 5 y ≡ 6(mod 7)

4 (i) Using CRT, solve the linear system x ≡ 3(mod 4) x ≡ 5(mod 9).
(ii) Solve the system of linear congruences: 2 x + 3 y ≡ 4(mod 13)
3 x + 4 y ≡ 5(mod 13).
5 (i)Solve the system of congruences: x ≡ 2 (mod 3), x ≡ 1(mod 4),
x ≡ 5(mod 11) using iteration method.

(ii) Using CRT, solve the linear system x ≡ 2 (mod 5) x ≡ 3(m od 7).

6 Using the iteration method, solve the linear system x ≡ 1(mod 3),
x ≡ 2(mod 5), x ≡ 3(m od 7).

Linear congruence problems and theorem

1 (i) Show that the linear congruence ax ≡ b (m od m ) is solvable if and only

if (a, m) divides b. Also, show that if (a, m) divides b, then it has d
incongruent solutions, where d = (a, m). (10)
(ii) Solve 4 x + 51 y = 9 by congruence method.

2 (i) Show that the linear congruence ax ≡ b (m od m ) is solvable if and only

if (a, m) divides b. Also, show that if (a, m) divides b, then it has d
incongruent solutions, where d = (a, m).
(ii) Solve 12 x + 18 y = 30 by congruence method.

3 Solve the system of congruences: x ≡ 2 (mod 3), x ≡ 1(mod 4),

x ≡ 5(m od 11) using iteration method.

4 Using the iteration method, solve the linear system x ≡ 1(mod 3),
x ≡ 2(mod 4), x ≡ 3(mod 5).

5 (i)Show that the linear congruence ax ≡ b (m od m ) is solvable if and only

if (a, m) divides b. Also, show that if (a, m) divides b, then it has d
incongruent solutions.
(ii) Solve 6 x ≡ 15(mod 21) .

6 (i) Show that the linear congruence ax ≡ b (m od m ) is solvable if and only

if (a, m) divides b. Also, show that if (a, m) divides b, then it has d
incongruent solutions, where d = (a, m).
(ii) Solve 12 x + 18 y = 30 by congruence method.

applications

1 i) State and prove hundred fowls puzzle.

(ii) Find the remainder when 3 2 47 is divided by 25.

2 (i) Explain and obtain the solution for Mahavira’s puzzle.

(ii)Find the remainder when 16 53 is divided by 7.

3 i) If a cock is worth five coins, a hen three coins, and three chicks together
one coin, how many cocks, hens, and chicks, totaling 100, can be bought
 for 100 coins?
(ii)Find the remainder when 3181 is divided by 17.

UNIT V
Theorems and problems

1
State and prove Wilson’s theorem.

2
State and prove Fermat’s little theorem.

3
Using Euler’s theorem, find the remainder when 193183 is divided by 19.

Find the remainder when 151976 is divided by 23 Fermat’s Theorem

4
(i)State and prove Fermat’s theorem.
(ii) Find the remainder when 241947 is divided by 17.

5
(i)State and prove Euler’s theorem (8)
1040
(ii) Using Euler’s theorem, find the remainder when 245 is divided by
18. (8)

6 If m is a positive integer and a is integer with ( a ,m)=1, then prove that

a ϕ ( m ) = 1(mod m) (16)

7 If p is a prime number and a is any integer not divisible by p then prove that
a p −1 = 1(mod p) (16)

8
(i)State and prove Euler’s theorem. (8)
(ii) Find the remainder when 151976 is divided by 23 Fermat’s Theorem (8)

9 (i) If p is prime number then prove that ( p − 1)! ≡ −1(mod p ). (8)

(ii) Find the remainder when 7 1020 is divided by 15 using Euler’s Theorem
(8)

Euler phi function, Tau and Sigma functions and problems

1
(i)Solve 24 x ≡ 11(mod 17 ) using Fermat’s theorem

(ii)Solve 12 x ≡ 6(mod 7) using Fermat’s theorem

2 If n = p1 1 p2 2 ... pk k is the canonical decomposition of a positive integer n,
e e e

then derive a formula to calculate the Euler’s phi function φ (n)

and compute φ (6860). also for n = 6125

3 Let n be a positive integer with canonical decomposition

n = p1e1 p2e2 ... pk ek . Derive
rive the formula for Tau and Sigma functions. Hence,
evaluate τ (n) and σ ( n ) for n = 6120. Also for n=1980

4 (i) Solve 25 x ≡ 13(mod 18) using Euler’s theorem.

(ii) Solve 35 x ≡ 47 (mod 24) using Euler’s theorem
(iii) Solve 5 x ≡ 3(mod 14) using Euler’s theorem