Counting: Combinations and Permutations

Related lectures (26)

Page 1 of 3

Introduces Cartesian product and induction for proofs using integers and sets.

Covers the local structure of totally disconnected locally compact groups, exploring properties and applications.

Covers the basics of group theory, including sets, applications, and examples like permutations and rotations.

Covers the normalization process of plane algebraic curves, focusing on irreducible polynomials and affine curves.

Explores the Symmetric group, cycle decomposition, Orbit-Stabilizer theorem, and properties of cycles and transpositions.

Covers the Symmetric group, cycle decomposition, transpositions, even and odd permutations, and group actions.

Covers permutation, combination, and the pigeonhole principle in counting problems.

Covers permutations and combinations with and without repetition, including examples with letters, fruits, bills, and equations.

Covers the concept of enumeration and counting subsets of a finite set with examples and factorial notation.