About Course
Modular arithmetic isn’t just about numbers—it’s the logical foundation behind cryptography, hashing algorithms, and data structures. Yet, many undergraduate and IT students find it to be one of the trickiest topics in discrete mathematics.
We take you from absolute basic definitions to advanced theorems, using clear explanations, visual breakdowns, and practical problem-solving. Whether you are preparing for an upcoming semester or trying to save your exam grade, this course gives you the exact strategies you need to solve complex congruence problems with total confidence.
What You Will Learn (Course Curriculum)
8.0. Introduction
8.1. Congruence
8.1.1. Congruence
8.1.2. Finding modulo of a given number
8.1.3. Properties of Congruence Modulo n
8.2. Modular Arithmetic
8.2.1. Addition, Subtraction, and Multiplication
8.2.2. Multiplication Property
8.2.3. Fermat’s Little Theorem
8.2.4. Modular Inverses
8.3. Application of Congruence
Divisibility Test
Determining the day of the week for any date.
8.4. Past Paper Questions
Who is this course for?
-
First Year Semester 1 Students of BIT
- Undergraduate IT & Computer Science Students tackling Discrete Mathematics.
Course Content
8.0. Introduction
-
Introduction
02:27
8.1. Congruence
8.2. Modular Arithmetic
8.3. Application of Congruence
8.4. Past Paper Questions
Student Ratings & Reviews
No Review Yet