Pell's equation

From Wikipedia, the free encyclopedia

Pell's equation is any Diophantine equation of the form

$x^2-ny^2=1\,$

where n is a nonsquare integer. In calling it "Diophantine" we are really saying what we intend to do with the equation rather than describing any intrinsic property of the equation: we intend to seek solutions in which both x and y are integers. Trivially, x = 1 and y = 0 always solve this equation; we are interested in nontrivial solutions. Lagrange proved that x and y > 0 can always be found to satisfy a Pell's equation for any natural number n that is not a perfect square, and infinitely many such solutions of this equation exist. These solutions yield good rational approximations of the form x/y to the square root of n.

The name of this equation arose from Leonhard Euler's mistakenly attributing its study to John Pell. Euler was aware of the work of Lord Brouncker, the first European mathematician to find a general solution of the equation, but apparently confused Brouncker with Pell. However, this equation was first studied extensively in India, starting with Brahmagupta, who developed the chakravala method to solve Pell's equation and other quadratic indeterminate equations in his Brahma Sphuta Siddhanta in 628, about a thousand years before Pell's time. His Brahma Sphuta Siddhanta was translated into Arabic in 773 and was subsequently translated into Latin in 1126. Bhaskara II in the 12th century and Narayana in the 14th century both found general solutions to Pell's equation and other quadratic indeterminate equations. Solutions to specific examples of the Pell 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 to a similar date in India.

For a more detailed discussion of much of the material here, see Lenstra (2002) and Barbeau (2003).

1 Solution technique
2 Example
3 Connection to algebraic number theory
4 Connection to Chebyshev polynomials
5 Other related results
6 Reference
7 External links

[edit] Solution technique

Let $\tfrac{h_i}{k_i}$ denote the sequence of convergents to the continued fraction for $\scriptstyle\sqrt{n}$ . Then the pair (x₁,y₁) 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.

Once the fundamental solution is found, all remaining solutions may be calculated algebraically as

$x_i + y_i\sqrt n = (x_1 + y_1\sqrt n)^i.$

Equivalently, we may calculate subsequent solutions via the recurrence relations

$\displaystyle x_{i+1} = x_1 x_i + n y_1 y_i,$

$\displaystyle y_{i+1} = x_1 y_i + y_1 x_i.$

[edit] Example

As an example, consider the instance of Pell's equation for n = 7; that is,

$\displaystyle x^2 - 7 y^2 = 1.$

The sequence of convergents for the square root of seven are

$\tfrac{h}{k} = \tfrac{2}{1}$ , with

h 2 - 7 k 2 = - 3,

$\tfrac{h}{k} = \tfrac{3}{1}$ , with

h 2 - 7 k 2 = 2,

$\tfrac{h}{k} = \tfrac{5}{2}$ , with

h 2 - 7 k 2 = - 3,

and

$\tfrac{h}{k} = \tfrac{8}{3}$ , with

h 2 - 7 k 2 = 1.

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

(8,3); (127,48); (2024,765); (32257,12192); (514088,194307); (8193151;3096720); (130576328,49353213); ...

[edit] Connection to 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 ℤ[√n] and for the closely related quadratic field ℚ(√n). Thus, a pair of integers (x,y) solves Pell's equation if and only if x + y√n has norm 1, and is a unit in ℤ[√n]. Dirichlet's unit theorem, all units of ℤ[√n] can be expressed as powers of a single fundamental unit; this is an algebraic restatement of the fact that all solutions to the Pell 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.

[edit] Connection to Chebyshev polynomials

Demeyer (2007) mentions an intriguing 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[x], with n = x² - 1:

$T_i^2 - (x^2-1) U_{i-1}^2 = 1$

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

$T_i + U_{i-1} \sqrt{x^2-1} = (x + \sqrt{x^2-1})^i.$

It may further be observed that, if (x_i,y_i) are the solutions to any integer Pell equation, then x_i = T_i (x₁) and y_i = y₁U_{i - 1}(x₁) (Barbeau, chapter 3).

[edit] Other related results

A general development of solutions of Pell's equation in terms of continued fractions can be presented, as these arise as a special case of quadratic irrationals. Gauss classified such solutions into 64 or 65 sets, with the precise classification of one or the other implying the truth or falsity of the Riemann hypothesis.

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{pmatrix} p & q \\ nq & p \end{pmatrix}$

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 n - 1 / q n - 1$ and $p n / q n$ are two successive convergents of a continued fraction, then the matrix

$\begin{pmatrix} p_{n-1} & p_{n} \\ q_{n-1} & q_{n} \end{pmatrix}$

has determinant (−1)ⁿ.

Størmer's theorem applies Pell equations to find pairs of consecutive smooth numbers. 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.

As Lenstra (2002) describes, Pell's equation can also be used to solve Archimedes' cattle problem.