Lectures related to Decimal Expansion: Division and Periodicity

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

Covers the construction and properties of rational numbers, including fractions and equivalence, with proofs on commutativity.

Covers the properties of Euclidean domains and irreducible elements in polynomial rings.

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

Covers the representation of integers using different bases and algorithms for base expansion.

Covers the representation of integers using different bases and the conversion between them.

Covers various methods for solving polynomial equations through examples.

Explores the concept of real numbers through decimal notation and fraction representation.

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.