Bézout's identity: ax+by=gcd(a,b)

Here's an example of using Bézout's identity, ax+by=gcd(a,b), to find all integer solutions to 432x+126y=18. The key is to use Euclid's algorithm, aka zigzag division, to find the greatest common factor of 432 and 126 and then connect the computations together. This is a very important concept in Number Theory. number theory playlist: https://www.youtube.com/playlist?list=PLj7p5OoL6vGzEZIo2yutOIaQhzVEwFKFm Check out Max! Proof of the Division Algorithm, https://youtu.be/ZPtO9HMl398 Support this channel Get more content 👉 https://www.patreon.com/blackpenredpen Shop my math t-shirt & hoodies 🛍 https://amzn.to/3qBeuw6