Once you know how to solve diophantine equations with a single variable, the next step in complexity is to consider equations with two variables. The simplest such equations are linear and take the form ax+by=c. Before we solve this equation generally, we need a preliminary result. We show that you can solve the equation ax+by=GCD(a,b) by performing the Euclidean algorithm, and then reverse-substituting to arrive at a single solution.
Teacher: Michael Harrison
♦♦♦♦♦♦♦♦♦♦
Ways to support our channel:
► Join our Patreon : https://www.patreon.com/socratica
► Make a one-time PayPal donation: https://www.paypal.me/socratica
♦♦♦♦♦♦♦♦♦♦
Connect with us!
Facebook: https://www.facebook.com/SocraticaStudios/
Instagram: https://www.instagram.com/SocraticaStudios/
Twitter: https://twitter.com/Socratica