From Wikipedia, the free encyclopedia

Pell's equation is any Diophantine equation of the form

where n is a nonsquare integer and x and y are integers. Trivially, x = 1 and y = 0 always solve this equation. Lagrange proved that for any natural number n that is not a perfect square there are x and y > 0 that satisfy Pell's equation. Moreover, 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. 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).

Contents 1 History 2 Solution technique 3 Example 4 Connection to algebraic number theory 5 Connection to Chebyshev polynomials 6 Pell's equation and continued fractions 7 References 8 External links

Pell's equations were studied as early as 400 BC in India and Greece. They were mainly interested in the equation

because of its connection to the square root of two. Indeed, if x and y are integers satisfying this equation, then x / y is an approximation of √2. For example, Baudhayana discovered that x = 17, y = 12 and x = 577, y = 408 are two solutions to the Pell equation, and give very close approximations to the square root of two.

Later, Archimedes used a similar equation to approximate the square root of 3, and found 1351/780.

Around AD 250, Diophantus created a different form of the Pell equation

He solved this equation for a = 1, and c = −1, 1, and 12, and also solved for a = 3 and c = 9.

Brahmagupta created a general way to solve Pell's equation known as the chakravala method. Alkarkhi worked on similar problems to Diophantus, and Bháscara Achárya created a way to create new solutions to Pell equations from one solution. E. Strachey published the work of Bháscara into English in 1813.

Let denote the sequence of convergents to the continued fraction for . 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

Equivalently, we may calculate subsequent solutions via the recurrence relations

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

The sequence of convergents for the square root of seven are

, with

, with

, with and

, with

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); ...

Pell's equation is closely related to the theory of algebraic numbers, as the formula

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.

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

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

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).

A general development of solutions of Pell's equation in terms of continued fractions can be presented, as the solutions x and y are approximates to the square root of n and thus are a a special case of continued fraction approximations for 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.^{[citation needed]}

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

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

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.

• Barbeau, Edward J. (2003). Pell's Equation, Problem Books in Mathematics. Springer-Verlag. MR1949691, ISBN 0387955291. 

• Demeyer, Jeroen (2007). Diophantine Sets over Polynomial Rings and Hilbert’s Tenth Problem for Function Fields, p. 70. Ph.D. thesis, Universiteit Gent. 

• Lenstra, H. W., Jr. (2002). "Solving the Pell Equation". Notices of the American Mathematical Society 49 (2): 182–192. MR1875156. 

• Pell's equation
• Pell's equation solver
• IMO Compendium text on Pell's equation in problem solving.