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/agent-almanac422026년 10월 21일 업데이트