# Number Theory / Modular Arithmetic

Engineering Mathematics Volume-1

This contains all Fundamentals and Advance concepts of Number Theory/Modular Arithmetic.

What you’ll learn

• In this course all fundamentals and advance Concepts of Number Theory/Modular Arithmetic are covered…
• The fundamental Concepts like, Calculation of GCD value, Euclidean algorithm, Extended Euclidean algorithm etc. are covered..
• The advance Concepts like Diophantine Equation, Chinese Remainder, Euler’s Theorem, Little Fermat’s Theorem, Prime Factor, Legendre and Jacobi symbol, etc..
• After Completion of this Course learner will be able to apply the core and fundamental concepts of number theory as per the need of application..

Course Content

• Introduction –> 2 lectures • 5min.
• Calculation of Modulus Value –> 2 lectures • 23min.
• Simplification of a ≡ b (mod m) –> 3 lectures • 49min.
• Commutative Law and Associative Law of Modular Arithmetic –> 2 lectures • 12min.
• Euclidean Algorithm –> 2 lectures • 24min.
• Diophantine Equation –> 7 lectures • 1hr 16min.
• Inverse Modulus Calculation –> 6 lectures • 31min.
• Linear Congruence ax ≡ b (mod m) –> 8 lectures • 59min.
• Chinese Remainder Theorem –> 8 lectures • 1hr 4min.
• Modular Exponentiation using Distributive Law –> 6 lectures • 41min.
• Fermat’s Little Theorem –> 8 lectures • 57min.
• Euler Totient Function –> 4 lectures • 34min.
• Euler’s Theorem –> 8 lectures • 59min.
• Prime Number –> 2 lectures • 14min.
• Prime Factor Calculation –> 3 lectures • 33min.
• Quadratic Residue –> 2 lectures • 20min.
• Legendre Symbol and Jacobi Symbol –> 10 lectures • 1hr 48min. Requirements

• This contains all Fundamentals and Advance concepts of Number Theory/Modular Arithmetic.
• This Course is designed in such a way that anybody will understand no matter whether you are beginner or expert.
• To start this course, you don’t require any prerequisites because all prerequisites are covered in course only.
• Here all course contents are organized in very systematic manner with clear crystal explanation.
• In this Course all types of problems are included which start from very basics to advanced.
• This Couse will be not only helpful to crack your university exam but also competitive exam like. GATE, NET, SET etc.
• To design this course inputs has been taken from experts who belong to reputed university professor, industrial expert, and university students.
• In this course we will cover, Euclidean Algorithm, Diophantine Equation, Inverse Modulus Calculation, Chinese Remainder Theorem, Modular Exponentiation, Little Fermat’s Theorem, Euler Theorem, Euler Totient Function, Prime Factor, Quadratic Residue, Legendre Symbol, and Jacobi Symbol.
• This Course is designed for those who belongs to Engineering Students, Mathematics Scholar, Research scholar from Information and Network security background.
• Engineering Vidya team ensure that you will like this course and after purchasing the course if you realize it doesn’t full fill your requirements, so you can claim for refund as per policy of Udemy.
Get Tutorial