Lecture
Smallest Common Multiple: Examples
Related lectures (30)
Fundamental Theorem of Arithmetic
Covers prime numbers, unique decomposition of natural numbers into prime factors, and practical implications for calculations.
Calculation in Rationals
Covers the calculation in rational numbers, focusing on GCD and LCM.
Rings and Fields
Explores rings, fields, ideals, and their properties in algebraic structures.
RSA Cryptosystem: Encryption and Decryption Process
Covers the RSA cryptosystem, encryption, decryption, group theory, Lagrange's theorem, and practical applications in secure communication.
Number Theory: Quiz
Covers fundamental concepts in number theory with examples and quizzes.
Proof of Explicit Formula
Covers the proof of the explicit formula for the non-vanishing of the zeta function at the 1-line.
Euclid and Bézout: Algorithms and Theorems
Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.
Primal-dual Optimization: Fundamentals
Explores primal-dual optimization, minimax problems, and gradient descent-ascent methods for optimization algorithms.
Integers: Well Ordering and Induction
Explores well ordering, induction, Euclidean division, and prime factorization in integers.
Optimization Methods: Convergence and Trade-offs
Covers optimization methods, convergence guarantees, trade-offs, and variance reduction techniques in numerical optimization.