Using the Euclidean algorithm to find solutions to linear Diophantine equations - Ex 1

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

amazing vid, thanks for helping me with my homework

RohitSharma-hhme
Автор

There are other numbers which when put into the equation also work why when using the euclidean algorithm are y = 21 and x = - 7 the only ones that come out?

derekdickson
Автор

why simplify it at the beginning? does that not defeat the purpose

Bruhmoment
Автор

8x + 3y = 7. Taking mod 3 gives -x = 1 mod 3, so x = -1. Then y = 5.

johnchang
Автор

Please do not use X as multiplication symbol. It's confusing and can be mistaken for a variable. Just use ( ), or even a dot. There is absolutely no reason to write it this way, esp. at this level of mathematics.

rebeccajohnson
Автор

what if HCF = 2 and you want the solution to Ax+By=7?

JUNGELMAN
Автор

Jayada angrejee mat bola karo maths is better understood in hindi

anandsharma