AI & Machine Learning
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.
- Publisher / source
- pjt222/agent-almanac (found on the CSV list)
- Upstream record
- pjt222/agent-almanac
- Version
- Version 1
- Published
- Publication review
- Approved for publication · recorded passed scan 2026-11-03
- Content fingerprint
60ac0e9a71951bcf117f2b6f547fc15852182ece9c1a35979e6b9ffbdc24fdd9