KTU 2024 Scheme · Semester 4 · Program Elective I — Artificial Intelligence and Data Science
Number Theory (PEADT416) Syllabus
Official KTU 2024 Scheme syllabus for Number Theory, Semester 4, Program Elective I — Artificial Intelligence and Data Science (Artificial Intelligence and Data Science).
Course Code
PEADT416
Credits
3
Teaching Hours
3:0:0:0 (L:T:P:R)
CIE Marks
40
ESE Marks
60
Exam Duration
2 Hrs. 30 Min.
Prerequisites
None
Semester
Semester 4
Course Objective
To provide the basic concepts of divisibility and prime numbers. To enable the learners develop problem-solving skills in the context of number theory.
Module-wise Syllabus
Module 1
9 contact hoursFundamentals - Polygonal numbers, Pyramidal numbers, Catalan numbers; Divisibility-Division algorithm, Number patterns, Prime and composite numbers, Fibonacci and Lucas numbers, Fermat numbers; Greatest common divisors - Greatest common divisor, Euclidean algorithm, Least Common Multiple, Linear Diophantine Equations.
Module 2
9 contact hoursCongruences - Congruences (Basics only), Linear congruences; Congruence Applications - divisibility tests, Modular designs, Check digits; Systems of Linear Congruences- Chinese remainder theorem, General Linear systems, 2x2 Linear systems; Wilson's theorem; Fermat's little theorem (Theorem and proof of theorem only).
Module 3
9 contact hoursMultiplicative Functions - Euler's Phi Function, Euler's Theorem, Tau and sigma function, Perfect numbers, Mersenne Primes; Primitive Roots- Order of a positive integer, Primality tests, Primitive roots of primes, Composites with primitive roots.
Module 4
9 contact hoursCryptology - Affine ciphers, Hill ciphers, Exponentiation ciphers, RSA CryptoSystem, Knapsack Ciphers.
Course Outcomes
- CO1Illustrate the operations and properties of integer arithmetic.
- CO2Use the concepts of prime numbers and factorization.
- CO3Solve Diophantine equations and congruences.
- CO4Use the concepts of the order of a positive integer, primality tests, and primitive roots of primes for ensuring security in computing systems.
- CO5Illustrate classical theorems of Number theory and Apply number theory to ciphers.
Assessment Pattern (CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation (CIE)
| Attendance | 5 |
| Assignment / Microproject | 15 |
| Internal Examination 1 (Written) | 10 |
| Internal Examination 2 (Written) | 10 |
End Semester Examination (ESE)
Total 60 marks, 2 Hrs. 30 Min.. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.
Textbooks & Reference Books
Textbooks
- Elementary Number Theory with Applications — Thomas Koshy (Elsevier Academic Press, 2/e, 2007)
Reference Books
- Elementary Number Theory — David M Burton (McGraw Hill, 7/e, 2011)
- Elementary Number Theory — Gareth A Jones, J Mary Jones (Springer, 1/e, 1998)
- Elementary Number Theory — Kenneth H Rosen (Pearson Education, 6/e, 2015)
Frequently Asked Questions
How many credits is KTU Number Theory (PEADT416)?
3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.
How many modules are in the PEADT416 syllabus?
4 modules, 36 total contact hours.
What is the CIE and ESE mark split for this course?
CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs. 30 Min.. Total: 100 marks.
What are the recommended textbooks for PEADT416?
Elementary Number Theory with Applications (Thomas Koshy).
Is this syllabus specific to one branch, or common to others too?
This Semester 4 course is listed under Program Elective I — Artificial Intelligence and Data Science at KTU under the 2024 Scheme — check the course header above for which branches it's common to.
Need help with KTU Number Theory?
Learnizo offers live, 1-on-1 online tuition for KTU AI&DS subjects — matched to your exact module and semester.