Pell's equation is the diophantine equation x squared minus n times y squared equals 1, where n is a positive integer that is not a perfect square, and it asks for integer solutions x and y. The Indian mathematician Brahmagupta found solutions to particular cases around 628 CE and developed a composition identity for generating new solutions from old ones, and the twelfth-century mathematician Bhaskara II gave the first general method, the chakravala technique, solving the equation for every value of n. Pierre de Fermat revived the problem in Europe in the 1650s, William Brouncker found solutions, Leonhard Euler mistakenly attached John Pell's name to the equation, and Joseph-Louis Lagrange developed the general theory using continued fractions between 1766 and 1769, proving that whenever n is not a perfect square, Pell's equation has infinitely many distinct integer solutions, all generated from a single fundamental solution. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Proved By
Source Pell's equation (Wikipedia)
Sources
1. Pell's equation (Wikipedia)
History
Joseph Louis Lagrange proved that, as long as n is not a perfect square, Pell's equation has infinitely many distinct integer solutions.
Proved By: Joseph-Louis Lagrange, Lead paragraph
Lagrange proved that, as long as n is not a perfect square, Pell
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.