Use Bezout's Identity to solve 2047x+147y=1

preview_player
Показать описание
Bézout's Identity to find the answer to ax+by=gcd(a,b) .
2047x+147y=1.
The values (a,b)=1 coprime , using the equation ax+by=1.
Euclid's Algorithm finds the gcd( greatest common divisor ) .
Bezout's Identity uses reverse substitution.
#euclidsalgorithm
#algebra
#algebra2inequalities
#algebraticos
#mathematical
#euclid_division_algorithm
#mathstricks
#longdivisionmethod
#numbertheory
#numbertricks
Рекомендации по теме
Комментарии
Автор

Easiest way:
x=(1/2)/2047, y=(1/2)/147

dracokinerek
welcome to shbcf.ru