Solving Linear Congruences by Using Euclidean Algorithm

Ann Lin

Подписаться 132

Просмотров 14 тыс.

50% 1

Видео Поделиться Скачать Добавить в

Опубликовано:

4 сен 2020

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 15

@liveandlaughandlearn 3 года назад

the beginning was helpful but then the ending where you go into all the equations could use some more explanation, it just seems like a lot of steps for a simple problem, but I benefitted from this ! thank you

@stevencheng7997 3 года назад

hey I am wondering if you could do more number theory/discrete math related videos? thanks!

@Bitrey Год назад

The explanation was not great but the example was awesome, I just needed something to make this all click and this video made it

@raymondmanahanhernandez 2 года назад

Thanks

@rvdvlogs2628 Год назад

How did you know that there will be 2 solutions? in 2 mod 18 there is no remainder, so where did you know that there will be 2 solutions?

@alikachmar137 Год назад

the gcd(a,n) = c, where c represents the number of solutions IFF gcd(a,n) | b

@ajoboemmanuel3918 3 года назад

At step 3 how did u get 2 solutions pls

@annlin8144 3 года назад

Since it is in mod 9, just add 9 to the first solution 6. Then the number 15 would be the second solution. (There are two solutions, explanation at 1:35) Hope that helps! Thanks for watching.

@ajoboemmanuel3918 3 года назад

@@annlin8144 OK thanks

@otizmusic4865 2 года назад

Each solutions are separated by 18/3=6 Final answer is x= 6(mod18) x= 12(mod 18)

@hkw6411 3 года назад

I think I understand Euclidean Algorithm well, but I couldn't follow you at all.... sorry.

@urstrulyjasim Год назад

Seductive voice..............

@okoyemildred8720 3 года назад

I don't mean to be mean but your explanations are annoying... imagine saying this to a beginner....he/she will just hate maths But thanks for your effort

@ajoboemmanuel3918 3 года назад

Exactly