| Module Name | Download |
|---|
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Introduction to Mathematical Logic | Download |
| 2 | Logical Equivalence | Download |
| 3 | SAT Problem | Download |
| 4 | Rules of Inference | Download |
| 5 | Resolution | Download |
| 6 | Tutorial 1: Part I | Download |
| 7 | Tutorial 1: Part II | Download |
| 8 | Predicate Logic | Download |
| 9 | Rules of Inferences in Predicate Logic | Download |
| 10 | Proof Strategies I | Download |
| 11 | Proof Strategies II | Download |
| 12 | Induction | Download |
| 13 | Tutorial 2: Part I | Download |
| 14 | Tutorial 2: Part II | Download |
| 15 | Sets | Download |
| 16 | Relations | Download |
| 17 | Operations on Relations | Download |
| 18 | Transitive Closure of Relations | Download |
| 19 | Warshall’s Algorithm for Computing Transitive Closure | Download |
| 20 | Tutorial 3 | Download |
| 21 | Equivalence Relation | Download |
| 22 | Equivalence Relations and Partitions | Download |
| 23 | Partial Ordering | Download |
| 24 | Functions | Download |
| 25 | Tutorial 4: Part I | Download |
| 26 | Tutorial 4: Part II | Download |
| 27 | Countable and Uncountable Sets | Download |
| 28 | Examples of Countably Infinite Sets | Download |
| 29 | Cantor’s Diagonalization Argument | Download |
| 30 | Uncomputable Functions | Download |
| 31 | Tutorial 5 | Download |
| 32 | Basic Rules of Counting | Download |
| 33 | Permutation and Combination | Download |
| 34 | Counting Using Recurrence Equations | Download |
| 35 | Solving Linear Homogeneous Recurrence Equations – Part I | Download |
| 36 | Solving Linear Homogeneous Recurrence Equations – Part II | Download |
| 37 | Tutorial 6: Part I | Download |
| 38 | Tutorial 6: Part II | Download |
| 39 | Solving Linear Non-Homogeneous Recurrence Equations | Download |
| 40 | Catalan Numbers | Download |
| 41 | Catalan Numbers – Derivation of Closed Form Formula | Download |
| 42 | Counting Using Principle of Inclusion-Exclusion | Download |
| 43 | Tutorial 7 | Download |
| 44 | Graph Theory Basics | Download |
| 45 | Matching | Download |
| 46 | Proof of Hall’s Marriage Theorem | Download |
| 47 | Various Operations on Graphs | Download |
| 48 | Vertex and Edge Connectivity | Download |
| 49 | Tutorial 8 | Download |
| 50 | Euler Path and Euler Circuit | Download |
| 51 | Hamiltonian Circuit | Download |
| 52 | Vertex and Edge Coloring | Download |
| 53 | Tutorial 9: Part I | Download |
| 54 | Tutorial 9: Part II | Download |
| 55 | Modular Arithmetic | Download |
| 56 | Prime Numbers and GCD | Download |
| 57 | Properties of GCD and Bézout’s Theorem | Download |
| 58 | Linear Congruence Equations and Chinese Remainder Theorem | Download |
| 59 | Uniqueness Proof of the CRT | Download |
| 60 | Fermat’s Little Theorem, Primality Testing and Carmichael Numbers | Download |
| 61 | Group Theory | Download |
| 62 | Cyclic Groups | Download |
| 63 | Subgroups | Download |
| 64 | Discrete Logarithm and Cryptographic Applications | Download |
| 65 | More Applications of Groups | Download |
| 66 | Rings, Fields and Polynomials | Download |
| 67 | Polynomials Over Fields and Properties | Download |
| 68 | Finite Fields and Properties I | Download |
| 69 | Finite Fields and Properties II | Download |
| 70 | Primitive Element of a Finite Field | Download |
| 71 | Applications of Finite Fields | Download |
| 72 | Goodbye and Farewell | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Introduction to Mathematical Logic | Download Verified |
| 2 | Logical Equivalence | Download Verified |
| 3 | SAT Problem | Download Verified |
| 4 | Rules of Inference | Download Verified |
| 5 | Resolution | Download Verified |
| 6 | Tutorial 1: Part I | Download Verified |
| 7 | Tutorial 1: Part II | Download Verified |
| 8 | Predicate Logic | Download Verified |
| 9 | Rules of Inferences in Predicate Logic | Download Verified |
| 10 | Proof Strategies I | Download Verified |
| 11 | Proof Strategies II | Download Verified |
| 12 | Induction | Download Verified |
| 13 | Tutorial 2: Part I | Download Verified |
| 14 | Tutorial 2: Part II | Download Verified |
| 15 | Sets | Download Verified |
| 16 | Relations | Download Verified |
| 17 | Operations on Relations | Download Verified |
| 18 | Transitive Closure of Relations | Download Verified |
| 19 | Warshall’s Algorithm for Computing Transitive Closure | Download Verified |
| 20 | Tutorial 3 | Download Verified |
| 21 | Equivalence Relation | PDF unavailable |
| 22 | Equivalence Relations and Partitions | PDF unavailable |
| 23 | Partial Ordering | PDF unavailable |
| 24 | Functions | PDF unavailable |
| 25 | Tutorial 4: Part I | PDF unavailable |
| 26 | Tutorial 4: Part II | PDF unavailable |
| 27 | Countable and Uncountable Sets | Download Verified |
| 28 | Examples of Countably Infinite Sets | Download Verified |
| 29 | Cantor’s Diagonalization Argument | Download Verified |
| 30 | Uncomputable Functions | Download Verified |
| 31 | Tutorial 5 | PDF unavailable |
| 32 | Basic Rules of Counting | PDF unavailable |
| 33 | Permutation and Combination | PDF unavailable |
| 34 | Counting Using Recurrence Equations | PDF unavailable |
| 35 | Solving Linear Homogeneous Recurrence Equations – Part I | PDF unavailable |
| 36 | Solving Linear Homogeneous Recurrence Equations – Part II | PDF unavailable |
| 37 | Tutorial 6: Part I | PDF unavailable |
| 38 | Tutorial 6: Part II | PDF unavailable |
| 39 | Solving Linear Non-Homogeneous Recurrence Equations | PDF unavailable |
| 40 | Catalan Numbers | PDF unavailable |
| 41 | Catalan Numbers – Derivation of Closed Form Formula | PDF unavailable |
| 42 | Counting Using Principle of Inclusion-Exclusion | PDF unavailable |
| 43 | Tutorial 7 | PDF unavailable |
| 44 | Graph Theory Basics | PDF unavailable |
| 45 | Matching | PDF unavailable |
| 46 | Proof of Hall’s Marriage Theorem | PDF unavailable |
| 47 | Various Operations on Graphs | PDF unavailable |
| 48 | Vertex and Edge Connectivity | PDF unavailable |
| 49 | Tutorial 8 | PDF unavailable |
| 50 | Euler Path and Euler Circuit | PDF unavailable |
| 51 | Hamiltonian Circuit | PDF unavailable |
| 52 | Vertex and Edge Coloring | PDF unavailable |
| 53 | Tutorial 9: Part I | PDF unavailable |
| 54 | Tutorial 9: Part II | PDF unavailable |
| 55 | Modular Arithmetic | PDF unavailable |
| 56 | Prime Numbers and GCD | PDF unavailable |
| 57 | Properties of GCD and Bézout’s Theorem | PDF unavailable |
| 58 | Linear Congruence Equations and Chinese Remainder Theorem | PDF unavailable |
| 59 | Uniqueness Proof of the CRT | PDF unavailable |
| 60 | Fermat’s Little Theorem, Primality Testing and Carmichael Numbers | PDF unavailable |
| 61 | Group Theory | PDF unavailable |
| 62 | Cyclic Groups | PDF unavailable |
| 63 | Subgroups | PDF unavailable |
| 64 | Discrete Logarithm and Cryptographic Applications | PDF unavailable |
| 65 | More Applications of Groups | PDF unavailable |
| 66 | Rings, Fields and Polynomials | PDF unavailable |
| 67 | Polynomials Over Fields and Properties | PDF unavailable |
| 68 | Finite Fields and Properties I | PDF unavailable |
| 69 | Finite Fields and Properties II | PDF unavailable |
| 70 | Primitive Element of a Finite Field | PDF unavailable |
| 71 | Applications of Finite Fields | PDF unavailable |
| 72 | Goodbye and Farewell | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |