Share Description
In this course, you will learn:
- Advanced topics in modular arithmetic, such as modular inverses and the extended Euclidean algorithm.
- Modular arithmetic applications include cryptography and error detection.
- The Chinese Remainder Theorem and its application to solving linear congruence systems.
- Fermat's Little Theorem and Euler's Totient Function are used in advanced number theory applications.
- Advanced methods for solving Diophantine equations with modular arithmetic.
- In-depth investigation of modular exponentiation and its applications in computer science and cryptography.
Syllabus:
- Base Formation
- Basic Properties of Congruency
- Divisibility Techniques
- Some Numerical Problems
- Advanced Levels Problems and Solutions
- Some Important Theorems and their Applications
- Chineses Remainder Theorem
