Extended Euclid Algorithm to solve 201x+81y=3
This is the first tutorial of a sequence of Bézout's Identity to find the answer to ax+by=gcd(a,b) .
In this video we have 201x+81y=3 .
We are looking to solve the equation for x and y in the shortest possible way.
first we use Euclids Algorithm to find the gcd( greatest common divisor ) .
Then we go in a backwards direction starting from the end , rewriting the algorithm to make the remainder the subject of the equation .
At each stage we substitute the remainder with the calculations that gave us the remainder.
proof of answer 2x201=402 , 5x81=405
• Eulers Phi Function and Number with 5...
• Solve a Quadratic Congruence with Jac...
• Solve 35a+55b+121c=1 by Euclids Algor...
• Bezout's Identity to solve ax+by=1 (a...
• Use Bezout's Identity to solve 2047x+...
• Use Euclidean Algorithm to find Great...
#euclidsalgorithm
#algebra
#algebra2inequalities
#algebraticos
#mathematical
#euclid_division_algorithm
#mathstricks
#longdivisionmethod
#numbertheory
#numbertricks
Смотрите видео Extended Euclid Algorithm to solve 201x+81y=3 онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь sumchief 27 Июль 2022, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 3,161 раз и оно понравилось 47 людям.