Lectures related to The Binomial Theorem

Introduces combinatorics and counting methods for determining possible outcomes in various scenarios, illustrated with examples.

Delves into using polynomials for combinatorial computations and explores operations and identities with binomial coefficients.

Covers the binomial formula, Euler number, and infinity, including induction and convergence of sequences.

Covers counting problems using generating functions to find solutions.

Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.

Covers commutative rings, fields, injective morphisms, characteristic, Frobenius, and binomial theorem.

Covers the definitions and elementary operations of real polynomials, including the binomial theorem and the Horner scheme.

Covers the basics of Bezier curves and introduces Bernstein polynomials.