Intro 0:00
The Algortihm 0:45
2D Example 6:30
3D Example 9:41
Algebraic Number Approximation 15:25
Cryptography 22:07
Mertens Conjecture 26:50
Lenstra-Lenstra-Lovasz (LLL) Lattice Basis Reduction Algorithm. A very useful algorithm for computational number theory.
Final project for M602 Algebraic Number Theory at Indiana University.
Special thanks to Grant Sanderson for creating the manim library, and to Jeff Suzuki for illuminating videos on the algorithm!
