Theory of numbers: Linear Diophantine equations @richarde.borcherds7998

Uploaded January 2021 | Updated September 2026, 2 weeks ago

This lecture is part of an online undergraduate course on the theory of numbers.

We show how to use Euclid's algorithm to solve linear Diophantine equations. As a variation, we discuss the problem of solving equations in non-negative integers. We also show how to solve systems of linear Diophantine equations.

For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H

Theory of numbers: Linear Diophantine equations

Rings 10 Tensor products of abelian groups

Complex analysis: Weierstrass elliptic functions

Theory of numbers: Congruences: Eulers theorem

Modular forms: Theta functions in higher dimensions

Introduction to number theory lecture 3: Divisibility and Euclids algorithms.

Vinberg lecture part 4. Automorphic forms

Introduction to number theory lecture 13. The Chinese remainder theorem.