Pell's equation

Pell's equation, also called the Pell–Fermat equation, is any Diophantine equation of the form $x^2 - ny^2 = 1,$ where ''n'' is a given positive nonsquare integer, and integer solutions are sought for ''x'' and ''y''. In Cartesian coordinates, the equation is represented by a hyperbola; solutions occur wherever the curve passes through a point whose ''x'' and ''y'' coordinates are both integers, such as the trivial solution with ''x'' = 1 and ''y'' = 0. Joseph Louis Lagrange proved that, as long as ''n'' is not a perfect square, Pell's equation has infinitely many distinct integer solutions. These solutions may be used to accurately approximate the square root of ''n'' by rational numbers of the form ''x''/''y''.

This equation was first studied extensively in India starting with Brahmagupta, who found an integer solution to $92x^2 + 1 = y^2$ in his ''Brāhmasphuṭasiddhānta'' circa 628. Bhaskara II in the 12th century and Narayana Pandit in the 14th century both found general solutions to Pell's equation and other quadratic indeterminate equations. Bhaskara II is generally credited with developing the ''chakravala'' method, building on the work of Jayadeva and Brahmagupta. Solutions to specific examples of Pell's equation, such as the Pell numbers arising from the equation with ''n'' = 2, had been known for much longer, since the time of Pythagoras in Greece and a similar date in India. William Brouncker was the first European to solve Pell's equation. The name of Pell's equation arose from Leonhard Euler mistakenly attributing Brouncker's solution of the equation to John Pell.In Euler's (pp. 227ff), he presents a solution to Pell's equation which was taken from John Wallis' , specifically, Letter 17 () and Letter 19 () of:
* The letters are in Latin. Letter 17 appears on pp. 56–72. Letter 19 appears on pp. 81–91.
* French translations of Wallis' letters: Letter 17 appears on pp. 457–480. Letter 19 appears on pp. 490–503.
Wallis' letters showing a solution to the Pell's equation also appear in volume 2 of Wallis' (1693), which includes articles by John Pell:
* Letter 17 is on pp. 789–798; letter 19 is on pp. 802–806. See also Pell's articles, where Wallis mentions (pp. 235, 236, 244) that Pell's methods are applicable to the solution of Diophantine equations:
:* (On Algebra by Dr. John Pell and especially on an incompletely determined problem), pp. 234–236.
:* (Example of Pell's method), pp. 238–244.
:* (Another example of Pell's method), pp. 244–246.
See also:
* Whitford, Edward Everett (1912) "The Pell equation", doctoral thesis, Columbia University (New York, New York, USA)
p. 52

*

History

As early as 400 BC in India and Greece, mathematicians studied the numbers arising from the ''n'' = 2 case of Pell's equation,
: $x^2 - 2y^2 = 1,$
and from the closely related equation
: $x^2 - 2y^2 = -1$
because of the connection of these equations to the square root of 2. Indeed, if ''x'' and ''y'' are positive integers satisfying this equation, then ''x''/''y'' is an approximation of . The numbers ''x'' and ''y'' appearing in these approximations, called side and diameter numbers, were known to the Pythagoreans, and Proclus observed that in the opposite direction these numbers obeyed one of these two equations. Similarly, Baudhayana discovered that ''x'' = 17, ''y'' = 12 and ''x'' = 577, ''y'' = 408 are two solutions to the Pell equation, and that 17/12 and 577/408 are very close approximations to the square root of 2.

Later, Archimedes approximated the square root of 3 by the rational number 1351/780. Although he did not explain his methods, this approximation may be obtained in the same way, as a solution to Pell's equation..
Likewise, Archimedes's cattle problem — an ancient word problem about finding the number of cattle belonging to the sun god Helios — can be solved by reformulating it as a Pell's equation. The manuscript containing the problem states that it was devised by Archimedes and recorded in a letter to Eratosthenes, and the attribution to Archimedes is generally accepted today.

Around AD 250, Diophantus considered the equation
: $a^2 x^2 + c = y^2,$
where ''a'' and ''c'' are fixed numbers, and ''x'' and ''y'' are the variables to be solved for.
This equation is different in form from Pell's equation but equivalent to it.
Diophantus solved the equation for (''a'', ''c'') equal to (1, 1), (1, −1), (1, 12), and (3, 9). Al-Karaji, a 10th-century Persian mathematician, worked on similar problems to Diophantus.

In Indian mathematics, Brahmagupta discovered that
: $(x_1^2 - Ny_1^2)(x_2^2 - Ny_2^2) = (x_1x_2 + Ny_1y_2)^2 - N(x_1y_2 + x_2y_1)^2,$
a form of what is now known as Brahmagupta's identity. Using this, he was able to "compose" triples $(x_1, y_1, k_1)$ and $(x_2, y_2, k_2)$ that were solutions of $x^2 - Ny^2 = k$, to generate the new triples
: $(x_1x_2 + Ny_1y_2 , x_1y_2 + x_2y_1 , k_1k_2)$ and $(x_1x_2 - Ny_1y_2 , x_1y_2 - x_2y_1 , k_1k_2).$
Not only did this give a way to generate infinitely many solutions to $x^2 - Ny^2 = 1$ starting with one solution, but also, by dividing such a composition by $k_1k_2$, integer or "nearly integer" solutions could often be obtained. For instance, for $N = 92$, Brahmagupta composed the triple (10, 1, 8) (since $10^2 - 92(1^2) = 8$) with itself to get the new triple (192, 20, 64). Dividing throughout by 64 ("8" for $x$ and $y$) gave the triple (24, 5/2, 1), which when composed with itself gave the desired integer solution (1151, 120, 1). Brahmagupta solved many Pell's equations with this method, proving that it gives solutions starting from an integer solution of $x^2 - Ny^2 = k$ for ''k'' = ±1, ±2, or ±4..

The first general method for solving the Pell's equation (for all ''N'') was given by Bhāskara II in 1150, extending the methods of Brahmagupta. Called the chakravala (cyclic) method, it starts by choosing two relatively prime integers $a$ and $b$, then composing the triple $(a, b, k)$ (that is, one which satisfies $a^2 - Nb^2 = k$) with the trivial triple $(m, 1, m^2 - N)$ to get the triple $\big(am + Nb, a + bm, k(m^2 - N)\big)$, which can be scaled down to

: $\left(\frac, \frac, \frac\right).$

When $m$ is chosen so that $\frac$ is an integer, so are the other two numbers in the triple. Among such $m$, the method chooses one that minimizes $\frac$ and repeats the process. This method always terminates with a solution (proved by Joseph-Louis Lagrange found how to solve the equation and in a 1657 letter issued it as a challenge to English mathematicians. In a letter to Kenelm Digby, Bernard Frénicle de Bessy said that Fermat found the smallest solution for ''N'' up to 150 and challenged John Wallis to solve the cases ''N'' = 151 or 313. Both Wallis and William Brouncker gave solutions to these problems, though Wallis suggests in a letter that the solution was due to Brouncker.

John Pell's connection with the equation is that he revised Thomas Branker's translation of Johann Rahn's 1659 book ''Teutsche Algebra'''' Teutsch'' is an obsolete form of ''Deutsch'', meaning "German". Free E-book
''Teutsche Algebra''
at Google Books. into English, with a discussion of Brouncker's solution of the equation. Leonhard Euler mistakenly thought that this solution was due to Pell, as a result of which he named the equation after Pell.

The general theory of Pell's equation, based on continued fractions and algebraic manipulations with numbers of the form $P + Q\sqrt,$ was developed by Lagrange in 1766–1769.

Solutions

Fundamental solution via continued fractions

Let $h_i/k_i$ denote the sequence of convergents to the regular continued fraction for $\sqrt$. This sequence is unique. Then the pair $(x_1, y_1)$ solving Pell's equation and minimizing ''x'' satisfies ''x''₁ = ''h_i'' and ''y''₁ = ''k_i'' for some ''i''. This pair is called the ''fundamental solution''. Thus, the fundamental solution may be found by performing the continued fraction expansion and testing each successive convergent until a solution to Pell's equation is found.

The time for finding the fundamental solution using the continued fraction method, with the aid of the Schönhage–Strassen algorithm for fast integer multiplication, is within a logarithmic factor of the solution size, the number of digits in the pair $(x_1, y_1)$. However, this is not a polynomial-time algorithm because the number of digits in the solution may be as large as , far larger than a polynomial in the number of digits in the input value ''n''..

Additional solutions from the fundamental solution

Once the fundamental solution is found, all remaining solutions may be calculated algebraically from
: $x_k + y_k \sqrt n = (x_1 + y_1 \sqrt n)^k,$
expanding the right side, equating coefficients of $\sqrt$ on both sides, and equating the other terms on both sides. This yields the recurrence relations
: $x_ = x_1 x_k + n y_1 y_k,$
: $y_ = x_1 y_k + y_1 x_k.$

Concise representation and faster algorithms

Although writing out the fundamental solution (''x''₁, ''y''₁) as a pair of binary numbers may require a large number of bits, it may in many cases be represented more compactly in the form
:$x_1+y_1\sqrt n = \prod_^t (a_i + b_i\sqrt n)^$
using much smaller integers ''a''_''i'', ''b''_''i'', and ''c''_''i''.

For instance, Archimedes' cattle problem is equivalent to the Pell equation $x^2 - 410\,286\,423\,278\,424 y^2 = 1$, the fundamental solution of which has digits if written out explicitly. However, the solution is also equal to
: $x_1 + y_1 \sqrt n = u^,$
where
: $u = x'_1 + y'_1 \sqrt = (300\,426\,607\,914\,281\,713\,365 \sqrt + 84\,129\,507\,677\,858\,393\,258 \sqrt)^2$
and $x'_1$ and $y'_1$ only have 45 and 41 decimal digits respectively.

Methods related to the quadratic sieve approach for integer factorization may be used to collect relations between prime numbers in the number field generated by and to combine these relations to find a product representation of this type. The resulting algorithm for solving Pell's equation is more efficient than the continued fraction method, though it still takes more than polynomial time. Under the assumption of the generalized Riemann hypothesis, it can be shown to take time
: $\exp O(\sqrt),$
where ''N'' = log ''n'' is the input size, similarly to the quadratic sieve.

Quantum algorithms

Hallgren showed that a quantum computer can find a product representation, as described above, for the solution to Pell's equation in polynomial time. Hallgren's algorithm, which can be interpreted as an algorithm for finding the group of units of a real quadratic number field, was extended to more general fields by Schmidt and Völlmer.

Example

As an example, consider the instance of Pell's equation for ''n'' = 7; that is,
: $x^2 - 7y^2 = 1.$
The sequence of convergents for the square root of seven are
:

Therefore, the fundamental solution is formed by the pair (8, 3). Applying the recurrence formula to this solution generates the infinite sequence of solutions

:(1, 0); (8, 3); (127, 48); (2024, 765); (32257, 12192); (514088, 194307); (8193151, 3096720); (130576328, 49353213); ... (sequence (''x'') and (''y'') in OEIS)

The smallest solution can be very large. For example, the smallest solution to $x^2 - 313y^2 = 1$ is (, ), and this is the equation which Frenicle challenged Wallis to solve. Values of ''n'' such that the smallest solution of $x^2 - ny^2 = 1$ is greater than the smallest solution for any smaller value of ''n'' are
: 1, 2, 5, 10, 13, 29, 46, 53, 61, 109, 181, 277, 397, 409, 421, 541, 661, 1021, 1069, 1381, 1549, 1621, 2389, 3061, 3469, 4621, 4789, 4909, 5581, 6301, 6829, 8269, 8941, 9949, ... .
(For these records, see for ''x'' and for ''y''.)

List of fundamental solutions of Pell's equations

The following is a list of the fundamental solution to $x^2 - ny^2 = 1$ with ''n'' ≤ 128. For square ''n'', there is no solution except (1, 0). The values of ''x'' are sequence and those of ''y'' are sequence in OEIS.

Connections

Pell's equation has connections to several other important subjects in mathematics.

Algebraic number theory

Pell's equation is closely related to the theory of algebraic numbers, as the formula
: $x^2 - n y^2 = (x + y\sqrt n)(x - y\sqrt n)$
is the norm for the ring $\mathbb$sqrt/math> and for the closely related quadratic field $\mathbb(\sqrt)$. Thus, a pair of integers $(x, y)$ solves Pell's equation if and only if $x + y \sqrt$ is a unit with norm 1 in $\mathbb$sqrt/math>. Dirichlet's unit theorem, that all units of $\mathbb$sqrt/math> can be expressed as powers of a single fundamental unit (and multiplication by a sign), is an algebraic restatement of the fact that all solutions to the Pell's equation can be generated from the fundamental solution. The fundamental unit can in general be found by solving a Pell-like equation but it does not always correspond directly to the fundamental solution of Pell's equation itself, because the fundamental unit may have norm −1 rather than 1 and its coefficients may be half integers rather than integers.

Chebyshev polynomials

Demeyer mentions a connection between Pell's equation and the Chebyshev polynomials:
If $T_i(x)$ and $U_i(x)$ are the Chebyshev polynomials of the first and second kind respectively, then these polynomials satisfy a form of Pell's equation in any polynomial ring R /math>, with $n = x^2 - 1$:

: $T_i^2 - (x^2-1) U_^2 = 1.$

Thus, these polynomials can be generated by the standard technique for Pell's equations of taking powers of a fundamental solution:

: $T_i + U_ \sqrt = (x + \sqrt)^i.$

It may further be observed that if $(x_i, y_i)$ are the solutions to any integer Pell's equation, then $x_i = T_i (x_1)$ and $y_i = y_1 U_ (x_1)$.

Continued fractions

A general development of solutions of Pell's equation $x^2 - ny^2 = 1$ in terms of continued fractions of $\sqrt$ can be presented, as the solutions ''x'' and ''y'' are approximates to the square root of ''n'' and thus are a special case of continued fraction approximations for quadratic irrationals.

The relationship to the continued fractions implies that the solutions to Pell's equation form a semigroup subset of the modular group. Thus, for example, if ''p'' and ''q'' satisfy Pell's equation, then

: $\begin p & q \\ nq & p \end$

is a matrix of unit determinant. Products of such matrices take exactly the same form, and thus all such products yield solutions to Pell's equation. This can be understood in part to arise from the fact that successive convergents of a continued fraction share the same property: If ''p''_''k''−1/''q''_''k''−1 and ''p''_''k''/''q''_''k'' are two successive convergents of a continued fraction, then the matrix

: $\begin p_ & p_ \\ q_ & q_ \end$

has determinant (−1)^''k''.

Smooth numbers

Størmer's theorem applies Pell equations to find pairs of consecutive smooth numbers, positive integers whose prime factors are all smaller than a given value. As part of this theory, Størmer also investigated divisibility relations among solutions to Pell's equation; in particular, he showed that each solution other than the fundamental solution has a prime factor that does not divide ''n''.

The negative Pell's equation

The negative Pell's equation is given by

: $x^2 - ny^2 = -1$

and has also been extensively studied. It can be solved by the same method of continued fractions and has solutions if and only if the period of the continued fraction has odd length. However, it is not known which roots have odd period lengths, and therefore not known when the negative Pell equation is solvable. A necessary (but not sufficient) condition for solvability is that ''n'' is not divisible by 4 or by a prime of form 4''k'' + 3.This is because the Pell equation implies that −1 is a quadratic residue modulo ''n''. Thus, for example, ''x''² − 3''ny''² = −1 is never solvable, but ''x''² − 5''ny''² = −1 may be.

The first few numbers ''n'' for which ''x''² − ''ny''² = −1 is solvable are
: 1, 2, 5, 10, 13, 17, 26, 29, 37, 41, 50, 53, 58, 61, 65, 73, 74, 82, 85, 89, 97, ... .

Let $\alpha = \Pi_ (1 - 2^j)$. The proportion of square-free ''n'' divisible by ''k'' primes of the form 4''m'' + 1 for which the negative Pell's equation is solvable is at least ''α''. When the number of prime divisors is not fixed, the proportion is given by 1 - ''α.''

If the negative Pell's equation does have a solution for a particular ''n'', its fundamental solution leads to the fundamental one for the positive case by squaring both sides of the defining equation:

: $(x^2 - ny^2)^2 = (-1)^2$

implies

: $(x^2 + ny^2)^2 - n(2xy)^2 = 1.$

As stated above, if the negative Pell's equation is solvable, a solution can be found using the method of continued fractions as in the positive Pell's equation. The recursion relation works slightly differently however. Since $(x + \sqrt y)(x - \sqrt y) = -1$, the next solution is determined in terms of $i(x_k + \sqrt y_k) = (i(x + \sqrt y))^k$ whenever there is a match, that is, when $k$ is odd. The resulting recursion relation is (modulo a minus sign, which is immaterial due to the quadratic nature of the equation)

: $x_k = x_ x_1^2 + n x_ y_1^2 + 2 n y_ y_1 x_1,$
: $y_k = y_ x_1^2 + n y_ y_1^2 + 2 x_ y_1 x_1,$

which gives an infinite tower of solutions to the negative Pell's equation.

Generalized Pell's equation

The equation
: $x^2 - dy^2 = N$
is called the generalized (or general) Pell's equation. The equation $u^2 - dv^2 = 1$ is the corresponding Pell's resolvent. A recursive algorithm was given by Lagrange in 1768 for solving the equation, reducing the problem to the case $, N, < \sqrt$. Such solutions can be derived using the continued-fractions method as outlined above.

If $(x_0, y_0)$ is a solution to $x^2 - dy^2 = N,$ and $(u_n, v_n)$ is a solution to $u^2 - dv^2 = 1,$ then $(x_n, y_n)$ such that $x_n + y_n \sqrt = \big(x_0 + y_0 \sqrt\big)\big(u_n + v_n \sqrt\big)$ is a solution to $x^2 - dy^2 = N$, a principle named the ''multiplicative principle''. The solution $(x_n, y_n)$ is called a ''Pell multiple'' of the solution $(x_0, y_0)$.

There exists a finite set of solutions to $x^2 - dy^2 = N$ such that every solution is a Pell multiple of a solution from that set. In particular, if $(u, v)$ is the fundamental solution to $u^2 - dv^2 = 1$, then each solution to the equation is a Pell multiple of a solution $(x, y)$ with $, x, \le \sqrt \left(\sqrt + 1\right) / 2$ and $, y, \le \sqrt \left(\sqrt + 1\right) / \big(2\sqrt\big)$, where $U = u + v \sqrt d$.

If ''x'' and ''y'' are positive integer solutions to the Pell's equation with $, N, < \sqrt d$, then $x/y$ is a convergent to the continued fraction of $\sqrt d$.

Solutions to the generalized Pell's equation are used for solving certain Diophantine equations and units of certain rings, and they arise in the study of SIC-POVMs in quantum information theory.

The equation

: $x^2 - dy^2 = 4$

is similar to the resolvent $x^2 - dy^2 = 1$ in that if a minimal solution to $x^2 - dy^2 = 4$ can be found, then all solutions of the equation can be generated in a similar manner to the case $N = 1$. For certain $d$, solutions to $x^2 - dy^2 = 1$ can be generated from those with $x^2 - dy^2 = 4$, in that if $d \equiv 5 \pmod,$ then every third solution to $x^2 - dy^2 = 4$ has $x, y$ even, generating a solution to $x^2 - dy^2 = 1$.

Notes

References

Further reading

*
*
*
*

External links

*
*

Pell equation solver
(''n'' has no upper limit)


(''n'' < 10¹⁰, can also return the solution to ''x''² − ''ny''² = ±1, ±2, ±3, and ±4)

{{DEFAULTSORT:Pell's Equation
Diophantine equations
Continued fractions