
Lecture 34 of 35 · Discrete Mathematics for CS
Nitin Saxena
Discrete Mathematics for CS · 35 lectures
35 lectures
1: What’s the course about
2: What are Proofs - 1
3: What are Proofs - 2
4: What are Proofs - 3
5: How to count - 1
6: How to count - 2
7: How to count - 3
8: How to count - 4 & What’s Combinatorics - 1
9: What’s Combinatorics - 2
10: What’s Combinatorics - 3 & What are Posets - 1
11: What are posets - 2
12: What are Posets - 3 & What are Graphs - 1
13: What are graphs - 2
14: What are Graphs - 3
15: What’re Graphs - 4
16: What’re Graphs - 5 & Graph Properties - 1
17: Graph Properties - 2
18: Colorings & Matchings - 1
19: Colorings & Matchings - 2
20: Colorings & Matchings - 3 & Properties of Numbers - 1
21: Properties of Numbers - 2
22: Properties of Numbers - 3
23: Properties of Numbers - 4
24: Properties of Numbers - 5 & Primes & Cryptography - 1
25: Primes & Cryptography - 2
26: Primes & Cryptography - 3 & Fields & Applications - 1
27: Fields & Applications - 2
28: Fields & Applications - 3
29: Fields & Applications - 4
30: Fields & Applications - 5
31: Fields & Applications - 6
32: Fields & Applications - 7 & What’s a Group - 1
33: What’s a group - 2
34: What’s a group - 3
35: Burnside’s Lemma & Normal Subgroups