Solving Linear Diophantine Equations using Euclid's Algorithm

preview_player
Показать описание
This video shows how to solve equations of the form ax + by = c using Euclid's Algorithm, where the solutions are restricted to integers (Diophantine equations). Occasionally this type of question is found at Maths Olympiads and the methods discussed in this video are well worth knowing.
Рекомендации по теме
Комментарии
Автор

hindi nakakasawang panuorin very well explain detailed by detailed thankyou so much

carlogo
Автор

very informative video sana marami pang vloggers ang gumawa ng mga ganitong content malaking tulong para sa lahat

peterivanylarde
Автор

keep it up more power sa channel mo godbless keep vlogging

lanceivanvlog
Автор

Another great video! My brain has been refreshed, thanks again! 😊

o.kgaming
Автор

Hey sir/ma’am could you pls answer this or please give me a tutorial on how to solve these?Find solution for each of the following LDEs using Euclidean Algorithm.
1. 2x + 3y =1
2.18x + 16y =5
3.23x + 19y = 17

alejandrocaburnay
Автор

akala ko dati mahirap ang math kapag sineryoso mo pala talagang mamahalin mo rin sya ng tunay

kevingo