Linear Diophantine Equations and the Extended Euclidean Algorithm - Lecture 1

Explore the second lecture in the first year undergraduate 'Constructive Mathematics' course, focusing on employing quotients computed during the Euclidean algorithm to find integer solutions of linear equations. Learn how to apply the extended Euclidean algorithm to solve linear Diophantine equations. Begin with a recap of the previous lecture, then delve into new concepts and techniques. Gain insights into the practical applications of these mathematical principles through this 49-minute University of Oxford student lecture. Enhance your understanding of constructive mathematics and prepare for follow-up tutorials where you can discuss the lecture content and associated problem sheets with your tutor.

Linear Diophantine equations and the extended Euclidean algorithm - 1st year student lecture