Linear Diophantine equations: a general method using extended Euclid
Solve ax + by = c without guessing: theory and example side by side, Bézout’s identity, every integer solution and non-negativity constraints. With a step-by-step laboratory.
ReadMathematics
Clear, organized learning paths that build strong foundations in mathematics and computer science.
Solve ax + by = c without guessing: theory and example side by side, Bézout’s identity, every integer solution and non-negativity constraints. With a step-by-step laboratory.
ReadA hundred animals, a hundred coins and three prices: Diophantine equations, gcd and congruences to find every solution, or prove that none exists. Twenty problems with click-to-reveal solutions.
ReadA collection with explained solutions: from full cycles to partly full turns, from the GCD to impossible cases. Laboratory with extended Euclid and simulation.
ReadAverbach and Chein’s method: interpret integer coefficients as fills and empties, construct the pours and follow them in a laboratory with two animated bars.
ReadThe exact solution to a sequence-position problem in which every natural number n appears exactly n times.
ReadDivisibility, the sieve of Eratosthenes and regularities that help explore primes.
ReadArticles 1–6 of 6