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 : / socratica
► Make a one-time PayPal donation: www.paypal.me/socratica
♦♦♦♦♦♦♦♦♦♦
Connect with us!
Facebook: / socraticastudios
Instagram: / socraticastudios
Twitter: / socratica
Негізгі бет Diophantine Equation: ax+by=gcd(a,b) ← Number Theory
Пікірлер: 155