Lectures related to Synthetic division

Explores eigenvalues and minimal polynomial, emphasizing their importance in linear algebra.

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.

Explores polynomial root finding methods based on evaluating potential roots from divisors of the constant term.

Explains Taylor polynomials, small o concept, variable changes, and remainder calculation.