Explore Diophantine Equations

Solve Diophantine equations (integer-only solutions) including linear, quadratic, and Pell equations. Covers the extended Euclidean algorithm, descent methods, and existence proofs. Use when finding all integer solutions to ax + by = c, solving Pell's equation, generating Pythagorean triples, proving no integer solutions exist via modular constraints, or finding the fundamental solution from which all others are generated.

pjt222 Updated 44 repo stars

File contents

pjt222/agent-almanac commit 093b7b1686

Frequently asked questions

npx get-skill add pjt222/explore-diophantine-equations-7