Lectures related to Falling and rising factorials

Covers mathematical proofs by induction, inequalities, divisibility, and subsets.

Explores the complexity of algorithms, including big-O notation and efficiency analysis.

Introduces recursive algorithms for factorial, exponentiation, and search.

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

Explores exploiting redundancies, confounding effects, and analyzing fractional factorials in experimental designs.