
Lecture 11 of 58 · Introduction to Algebraic Structures
NPTEL IISc Bengaluru
Introduction to Algebraic Structures · 58 lectures
58 lectures
10: Partially ordered sets, well-ordering principle and Zorn’s
9: Correspondence between partitions of a set and equivalence
8: Axiom of choice and Paritition of a set
7: Don Zaiger’s proof: Primes of the form 4k+1 can written as
6: Composing functions and Cantor’s theorem
5: Properties of functions
4: Functions
3: Logic and construction of new sets
2: Set identities, Cartesian product, relations and functions
1: Introduction to mathematics and set theory
11: Defining natural numbers: Peano axioms
12: Order properties of natural numbers and notion
13: Cardinality of a finite set
14: Countable sets
15: Uncountable sets
16: Schroder-Bernstein theorem
17: Integers and Rational Numbers
18: The Construction of Rational Numbers and Counting Principles
19: Counting in Two Ways
20: Binomial Coefficients and Properties
21: The Pigeonhole Principle
22: Formal Series
23: Formal Series and Applications
24: Solving Linear Recurrences
25: Principle of Inclusion and Exclusion
26: Möbius Function on Finite Posets
27: Möbius Inversion Formula
28: Möbius Inversion Formula and Applications
29: Introduction to Graph Theory
30: Graph Representations and Basic Graph Operations
31: Handshake Lemma and Graph Connectivity
32: Cycles, Bipartite Graphs, and Trees
33: Trees and Their Properties
34: Eulerian and Hamiltonian Graphs
35: Matchings and Graph Coloring
36: Number theory and divisibility
37: Greatest Common Divisor - I
38: Greatest Common Divisor - II
39: LCM, primes and prime factorisation
40: Consequences of prime factorisation and infinitude of primes
41: Euler’s proof of infinitude of primes
42: Congruencies and modular arithmetic
43: Diophantine equations and residue classes
44: Solving Diophantine equations in one variable and Chinese
45: Solving Diophantine equations using CRT
46: Proof of Hensel’s lemma
47: Introduction to Euler’s totient function
48: More on totient function
49: Mobius inversion formula
50: Euler’s theorem
51: Ring structure on set of residue classes
52: Polynomial ring over a field
53: Wilson’s theorem, Lagrange’s theorem and introduction
54: Classification of cyclic unit groups modulo m and proof
55: Primitive roots modulo m and application in solving linear
56: More on solving congruence equations & introduction
57: Computing Legendre symbol
58: Dirichlet’s theorem on primes in AP: Proof of special cases