ALGEBRA AND NUMBER THEORY 3 1 0 4

OBJECTIVE

This course comprehends the basic notions of groups, rings, fields and theory of
numbers, which are then provided with an integrated approach, and that firm a basis for
cryptography and coding theory.

UNIT I FIELDS 9+3

Group Theory Rings and Polynomials Fields.

UNIT II FINITE FIELDS AND POLYNOMIALS 9+3

Finite Fields Irreducible Polynomials over Finite fields Factorization of
Polynomials over Finite Fields.

UNIT - III DIVISIBILITY & CANONICAL DECOMPOSITIONS 9+3

Division algorithm Base-b representations number patterns Prime and
composite numbers Fibonacci and Lucas numbers Fermat numbers GCD
Euclidean Algorithm Fundamental theorem of Arithmetic LCM.

UNIT IV DIOPHANTINE EQUATIONS AND CONGRUENCES 7+3

Linear Diophantine equations Congruences Linear Congruences
Applications: Divisibility tests Modular Designs Chinese remainder theorem
2x2 linear systems.

UNIT V CLASSICAL THEOREMS AND MULTIPLICATIVE 10+4
FUNCTIONS

Wilsons theorem Fermats Little theorem Eulers theorem Eulers Phi
functions Tau and Sigma functions Perfect numbers Mersenne Primes
Mobius Function.

TOTAL: 60

TEXT BOOKS:

1. Lidl.R., and Pilz. G., Applied Abstract Algebra, Springer-Verlag, New Delhi,
2nd Edition, 2006.
2. Thomas Koshy, Elementary Number Theory with Applications, Elsevier
Publications, New Delhi, 2002.



REFERENCES:

1. San Ling and Chaoping Xing, Coding Theory A first Course, Cambridge
Publications, Cambridge, 2004.
2. Niven.I, Zuckerman.H.S., and Montgomery, H.L., An Introduction to Theory
of Numbers , John Wiley and Sons, Singapore, 2004.