MATH F231 - Handout

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

FIRST SEMESTER, 2022 - 2023

Course Handout Part II


29-08-2022

In addition to Part-I (General Handout for all courses appended to the timetable) this portion gives further specific
details regarding the course.

Course No. : MATH F231


Course Title: Number Theory
Instructor In-charge: Rohit Gupta

Scope and Objective of the Course:


In this course we cover the basic mathematical notation and methods which include mathematical induction,
properties of divisors, prime numbers, integer functions, equations in integers and the applications of some of the
concepts. The main objective of this course is to understand the divisibility properties of integers and other related
topics as a basis for studying more advanced topics in Number Theory, Modern Algebra, and the number theoretic
cryptography algorithms.

1. Text Book:
Thomas Koshy: Elementary Number Theory with Applications, Second Edition, Academic Press, 2007.

2. Reference Books:
(i) Kenneth H. Rosen: Elementary Number Theory and its Applications, Addison – Wesley
publishing Company, 1986.
(ii) Neal Koblitz: A Course in Number Theory and Cryptography, 2nd Edition, Springer, 1994.
(iii) Tom M. Apostol: Introduction to Analytic Number theory, Springer, 1976.

3. Course Plan:

Chapter in
Lecture
Learning objectives Topics to be covered the Text
No.
Book
Fundamental properties, the
summation and product notations,
To explain the fundamental 1.1 – 1.5
1 mathematical induction, recursion, the
properties of integers
binomial theorem

To examine the correctness


2 – 3 The division algorithm 2.1
of a division problem
Prime numbers, composite numbers,
To classify the various Fibonacci numbers, Lucas numbers,
4 – 6 2.5 – 2.7
classes of positive integers Fermat numbers

To list the fundamental


7 Greatest common divisor 3.1
operations on integers
To know how to find the
greatest common divisor of
8 – 9 The Euclidean algorithm 3.2
two numbers having
prime factorizations.
To know how to factorize
10 The fundamental theorem of arithmetic 3.3
any positive integer
To learn linear Diophantine Least common multiple, linear
11 – 13 3.4 – 3.5
equations Diophantine equations
To define what is congruence congruence, linear congruence, the Pollard Rho
14-16 and explain their factoring method 4.1 – 4.3
fundamental properties
To explain the four classical Chinese remainder theorem, Wilson’s theorem,
6.1 – 6.3, 7.1,
17 – 22 mile stone Fermat’s little theorem, Euler’s theorem
7.2, 7.4
theorems in number theory
To define the multiplicative
Euler’s phi function, the tau and sigma
23 – 26 functions and to explain their 8.1 – 8.2, 8.5
functions, the Mobius function
properties
27 – 29 To explain perfect numbers Perfect numbers, Mersenne primes 8.3 – 8.4

To define the order of an The order of a positive integer, primality tests,


30 – 33 10.1 – 10.3
integer and primitive roots primitive roots for primes
To define quadratic residues Quadratic residues, the Legendre
and to explain the symbol, quadratic reciprocity, the
34 – 38 11.1 – 11.4
famous law of quadratic Jacobi symbol,
reciprocity
To explain the continued Finite continued fractions, infinite
39 – 40 12.1 – 12.2
fractions continued fractions

4. Evaluation Scheme:

ECNo.
Evaluation Weightage Nature of
Duration Date
Component (%) Component

1. Quiz-I To be announced 10 To be Open Book


announced
later
later
2. Mid Semester Exam 90 min. 35 02/11 9.00 - Closed Book
10.30AM
3. Quiz-II To be announced 10 To be Open Book
announced
later
later
4. Comprehensive 180 min. 45 22/12 FN Closed Book
Exam

Total marks: 200

5. Chamber consultation hour: Will be announced in the class.

6. Notices: The notices concerning this course will be displayed in CMS.


7. Make-up Policy: Make-up for tests will be given only for very genuine cases and prior permission
has to be obtained from Instructor In-charge.

8. Academic Honesty and Integrity Policy: Academic honesty and integrity are to be maintained by all the students
throughout the semester and no type of academic dishonesty is acceptable.

Instructor In-charge

MATH
F231

You might also like