NT Syllabus
NT Syllabus
L T P S J C
MATH2311 NUMBER THEORY 2 0 0 0 0 2
Pre-requisite None
Co- requisite None
Preferable Engineering and Science
exposure
Course Description:
This course is designed to explain the basics and applications of number theory for the students
of Computer Science. The core courses of these branches encounter with concepts like prime
factorization, modular arithmetic, and quadratic reciprocities in number theory. The first unit
of the course provide a strong platform for such encounters and the other units focuses on
applications of number theory.
UNIT 2 5 Hours
Fundamental theorem of Arithmetic, Congruences, Properties of congruences, Linear
congruences
UNIT 3 5 Hours
Fermat's theorem, Fermat's little theorem, Wilson’s theorem
UNIT 4 5 Hours
Chinese remainder theorem, The functions 𝜏𝜏 𝑎𝑎𝑎𝑎𝑎𝑎 𝜎𝜎, Euler Phi-function, Euler’s theorem,
Some properties of phi function
UNIT 5 5 Hours
The order of integer modulo n, Primitive roots for prime, Composite number having
primitive roots
Textbooks:
1. Elementary Number Theory | 7th Edition by David Burton, Mc Graw Hill Education
References:
1. Basic Number Theory by S.B. Malik,S. Chand publishers
Course Outcomes:
Upon successful completion of this course the student should be able to
1. Apply concepts of number theory focusing on Computational aspects.
2. Analyze concepts of factorization of integers.
3. Explain Fermat’s theorem and quadratic residues.
4. Analyse Chines remainder theorem and Euclidean algorithm.
5. Analyse the concept of polynomial arithmetic.
CO-PO Mapping:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1
CO2 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1
CO3 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1
CO4 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1
CO5 2 1 1 1 1 1 1 1 1 1 1 1 2 1 1
APPROVED IN:
BOS : 26-04-2021 ACADEMIC COUNCIL: 17-09-2021