Home
Material
Light
Dark
Automatic
diophantine equations
Bezout's Lemma and the Fundemental Theorem of Arithmetic
Unlimited Power ⛈️ Now that we have the machinery1 of the $\gcd$ and general divisibility, we can touch on a theorem that will unlock us the ability to prove a ton of problems that otherwise would have been super freaking annoying to solve without it.
Last updated on Aug 30, 2023