Discrete Mathematics - Vol 3
Engineering · 27 chapters · 324 sections · about 218 hours
Chapters
27 chapters · 324 sections- 1Euler Path and Euler Circuit8 sections
- 2Hamiltonian Circuit7 sections
- 3Vertex and Edge Colouring12 sections
- 4Prof. Ashish Choudhury21 sections
- 5Lecture - 5416 sections
- 6Question 9: Proving a Graphic Sequence6 sections
- 7Lecture - 55: Modular Arithmetic20 sections
- 8Prime Numbers and GCD14 sections
- 9Lecture – 57: Properties of GCD and Bezout’s Theorem8 sections
- 10Linear Congruence Equations and Chinese Remainder Theorem11 sections
- 11Uniqueness Proof of the CRT8 sections
- 12Introduction to Fermat’s Little Theorem and Primality Testing21 sections
- 13Group Theory17 sections
- 14Cyclic Groups9 sections
- 15Subgroups8 sections
- 16Lecture - 6425 sections
- 17More Applications of Groups9 sections
- 18Key Agreement and Secure Communication16 sections
- 19Rings, Fields and Polynomials11 sections
- 20Polynomials Over Fields and Properties7 sections
- 21Roots of a Polynomial10 sections
- 22Finite Fields and Properties I7 sections
- 23Roots of a Polynomial10 sections
- 24Finite Fields and Properties I7 sections
- 25Overview 4114 sections
- 26Basics 238 sections
- 27Fundamentals 4714 sections
About this course
Discrete mathematics is the study of mathematical structures that are fundamentally countable or distinct, as opposed to continuous. It forms the foundation for computer science and is crucial for understanding algorithms, data structures, and computational logic