Modules / Lectures
Module NameDownload


Sl.No Chapter Name MP4 Download
1Introduction to Mathematical LogicDownload
2Logical EquivalenceDownload
3SAT ProblemDownload
4Rules of InferenceDownload
5ResolutionDownload
6Tutorial 1: Part IDownload
7Tutorial 1: Part IIDownload
8Predicate LogicDownload
9Rules of Inferences in Predicate LogicDownload
10Proof Strategies IDownload
11Proof Strategies IIDownload
12InductionDownload
13Tutorial 2: Part IDownload
14Tutorial 2: Part IIDownload
15SetsDownload
16RelationsDownload
17Operations on RelationsDownload
18Transitive Closure of RelationsDownload
19Warshall’s Algorithm for Computing Transitive ClosureDownload
20Tutorial 3Download
21Equivalence RelationDownload
22Equivalence Relations and PartitionsDownload
23Partial OrderingDownload
24FunctionsDownload
25Tutorial 4: Part IDownload
26Tutorial 4: Part IIDownload
27Countable and Uncountable SetsDownload
28Examples of Countably Infinite SetsDownload
29Cantor’s Diagonalization ArgumentDownload
30Uncomputable FunctionsDownload
31Tutorial 5Download
32Basic Rules of CountingDownload
33Permutation and CombinationDownload
34Counting Using Recurrence EquationsDownload
35Solving Linear Homogeneous Recurrence Equations – Part IDownload
36Solving Linear Homogeneous Recurrence Equations – Part IIDownload
37Tutorial 6: Part IDownload
38Tutorial 6: Part IIDownload
39Solving Linear Non-Homogeneous Recurrence EquationsDownload
40Catalan NumbersDownload
41Catalan Numbers – Derivation of Closed Form FormulaDownload
42Counting Using Principle of Inclusion-ExclusionDownload
43Tutorial 7Download
44Graph Theory BasicsDownload
45MatchingDownload
46Proof of Hall’s Marriage TheoremDownload
47Various Operations on GraphsDownload
48Vertex and Edge ConnectivityDownload
49Tutorial 8Download
50Euler Path and Euler CircuitDownload
51Hamiltonian CircuitDownload
52Vertex and Edge ColoringDownload
53Tutorial 9: Part IDownload
54Tutorial 9: Part IIDownload
55Modular ArithmeticDownload
56Prime Numbers and GCDDownload
57Properties of GCD and Bézout’s TheoremDownload
58Linear Congruence Equations and Chinese Remainder TheoremDownload
59Uniqueness Proof of the CRTDownload
60Fermat’s Little Theorem, Primality Testing and Carmichael NumbersDownload
61Group TheoryDownload
62Cyclic GroupsDownload
63SubgroupsDownload
64Discrete Logarithm and Cryptographic Applications Download
65More Applications of GroupsDownload
66Rings, Fields and PolynomialsDownload
67Polynomials Over Fields and PropertiesDownload
68Finite Fields and Properties IDownload
69Finite Fields and Properties IIDownload
70Primitive Element of a Finite FieldDownload
71Applications of Finite FieldsDownload
72Goodbye and FarewellDownload

Sl.No Chapter Name English
1Introduction to Mathematical LogicDownload
Verified
2Logical EquivalenceDownload
Verified
3SAT ProblemDownload
Verified
4Rules of InferenceDownload
Verified
5ResolutionDownload
Verified
6Tutorial 1: Part IDownload
Verified
7Tutorial 1: Part IIDownload
Verified
8Predicate LogicDownload
Verified
9Rules of Inferences in Predicate LogicDownload
Verified
10Proof Strategies IDownload
Verified
11Proof Strategies IIDownload
Verified
12InductionDownload
Verified
13Tutorial 2: Part IDownload
Verified
14Tutorial 2: Part IIDownload
Verified
15SetsDownload
Verified
16RelationsDownload
Verified
17Operations on RelationsDownload
Verified
18Transitive Closure of RelationsDownload
Verified
19Warshall’s Algorithm for Computing Transitive ClosureDownload
Verified
20Tutorial 3Download
Verified
21Equivalence RelationPDF unavailable
22Equivalence Relations and PartitionsPDF unavailable
23Partial OrderingPDF unavailable
24FunctionsPDF unavailable
25Tutorial 4: Part IPDF unavailable
26Tutorial 4: Part IIPDF unavailable
27Countable and Uncountable SetsDownload
Verified
28Examples of Countably Infinite SetsDownload
Verified
29Cantor’s Diagonalization ArgumentDownload
Verified
30Uncomputable FunctionsDownload
Verified
31Tutorial 5PDF unavailable
32Basic Rules of CountingPDF unavailable
33Permutation and CombinationPDF unavailable
34Counting Using Recurrence EquationsPDF unavailable
35Solving Linear Homogeneous Recurrence Equations – Part IPDF unavailable
36Solving Linear Homogeneous Recurrence Equations – Part IIPDF unavailable
37Tutorial 6: Part IPDF unavailable
38Tutorial 6: Part IIPDF unavailable
39Solving Linear Non-Homogeneous Recurrence EquationsPDF unavailable
40Catalan NumbersPDF unavailable
41Catalan Numbers – Derivation of Closed Form FormulaPDF unavailable
42Counting Using Principle of Inclusion-ExclusionPDF unavailable
43Tutorial 7PDF unavailable
44Graph Theory BasicsPDF unavailable
45MatchingPDF unavailable
46Proof of Hall’s Marriage TheoremPDF unavailable
47Various Operations on GraphsPDF unavailable
48Vertex and Edge ConnectivityPDF unavailable
49Tutorial 8PDF unavailable
50Euler Path and Euler CircuitPDF unavailable
51Hamiltonian CircuitPDF unavailable
52Vertex and Edge ColoringPDF unavailable
53Tutorial 9: Part IPDF unavailable
54Tutorial 9: Part IIPDF unavailable
55Modular ArithmeticPDF unavailable
56Prime Numbers and GCDPDF unavailable
57Properties of GCD and Bézout’s TheoremPDF unavailable
58Linear Congruence Equations and Chinese Remainder TheoremPDF unavailable
59Uniqueness Proof of the CRTPDF unavailable
60Fermat’s Little Theorem, Primality Testing and Carmichael NumbersPDF unavailable
61Group TheoryPDF unavailable
62Cyclic GroupsPDF unavailable
63SubgroupsPDF unavailable
64Discrete Logarithm and Cryptographic Applications PDF unavailable
65More Applications of GroupsPDF unavailable
66Rings, Fields and PolynomialsPDF unavailable
67Polynomials Over Fields and PropertiesPDF unavailable
68Finite Fields and Properties IPDF unavailable
69Finite Fields and Properties IIPDF unavailable
70Primitive Element of a Finite FieldPDF unavailable
71Applications of Finite FieldsPDF unavailable
72Goodbye and FarewellPDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available