Pell number


mathematics Mathematics (from Greek: ) includes the study of such topics as numbers ( and ), formulas and related structures (), shapes and spaces in which they are contained (), and quantities and their changes ( and ). There is no general consensus abo ...
, the Pell numbers are an infinite
sequence In , a sequence is an enumerated collection of in which repetitions are allowed and matters. Like a , it contains (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unl ...

integers An integer (from the Latin Latin (, or , ) is a classical language belonging to the Italic languages, Italic branch of the Indo-European languages. Latin was originally spoken in the area around Rome, known as Latium. Through the power of t ...

, known since ancient times, that comprise the
denominator A fraction (from Latin Latin (, or , ) is a classical language belonging to the Italic languages, Italic branch of the Indo-European languages. Latin was originally spoken in the area around Rome, known as Latium. Through the power of the Rom ...
s of the closest rational approximations to the square root of 2. This sequence of approximations begins , , , , and , so the sequence of Pell numbers begins with 1, 2, 5, 12, and 29. The numerators of the same sequence of approximations are half the companion Pell numbers or Pell–Lucas numbers; these numbers form a second infinite sequence that begins with 2, 6, 14, 34, and 82. Both the Pell numbers and the companion Pell numbers may be calculated by means of a recurrence relation similar to that for the Fibonacci numbers, and both sequences of numbers exponential growth, grow exponentially, proportionally to powers of the silver ratio 1 + . As well as being used to approximate the square root of two, Pell numbers can be used to find square triangular numbers, to construct integer approximations to the right isosceles triangle, and to solve certain combinatorial enumeration problems. As with Pell's equation, the name of the Pell numbers stems from Leonhard Euler, Leonhard Euler's mistaken attribution of the equation and the numbers derived from it to John Pell. The Pell–Lucas numbers are also named after Édouard Lucas, who studied sequences defined by recurrences of this type; the Pell and companion Pell numbers are Lucas sequences.

Pell numbers

The Pell numbers are defined by the recurrence relation: :P_n=\begin0&\mboxn=0;\\1&\mboxn=1;\\2P_+P_&\mbox\end In words, the sequence of Pell numbers starts with 0 and 1, and then each Pell number is the sum of twice the previous Pell number and the Pell number before that. The first few terms of the sequence are :0, 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860,… . The Pell numbers can also be expressed by the closed form formula :P_n=\frac. For large values of ''n'', the term dominates this expression, so the Pell numbers are approximately proportional to powers of the silver ratio , analogous to the growth rate of Fibonacci numbers as powers of the golden ratio. A third definition is possible, from the Matrix (mathematics), matrix formula :\begin P_ & P_n \\ P_n & P_ \end = \begin 2 & 1 \\ 1 & 0 \end^n. Many identities can be derived or proven from these definitions; for instance an identity analogous to Cassini's identity for Fibonacci numbers, :P_P_-P_n^2 = (-1)^n, is an immediate consequence of the matrix formula (found by considering the determinants of the matrices on the left and right sides of the matrix formula).

Approximation to the square root of two

Pell numbers arise historically and most notably in the diophantine approximation, rational approximation to square root of 2, . If two large integers ''x'' and ''y'' form a solution to the Pell equation :x^2-2y^2=\pm 1, then their ratio ' provides a close approximation to . The sequence of approximations of this form is :\frac11, \frac32, \frac75, \frac, \frac, \frac, \dots where the denominator of each fraction is a Pell number and the numerator is the sum of a Pell number and its predecessor in the sequence. That is, the solutions have the form :\frac. The approximation :\sqrt 2\approx\frac of this type was known to Indian mathematicians in the third or fourth century B.C. The Greek mathematicians of the fifth century B.C. also knew of this sequence of approximations: Plato refers to the numerators as rational diameters. In the 2nd century CE Theon of Smyrna used the term the side and diameter numbers to describe the denominators and numerators of this sequence. These approximations can be derived from the continued fraction expansion of \scriptstyle\sqrt 2: :\sqrt 2 = 1 + \cfrac. Truncating this expansion to any number of terms produces one of the Pell-number-based approximations in this sequence; for instance, :\frac = 1 + \cfrac. As Knuth (1994) describes, the fact that Pell numbers approximate allows them to be used for accurate rational approximations to a regular octagon with vertex coordinates and . All vertices are equally distant from the origin, and form nearly uniform angles around the origin. Alternatively, the points (\pm(P_i+P_),0), (0,\pm(P_i+P_)), and (\pm P_i,\pm P_i) form approximate octagons in which the vertices are nearly equally distant from the origin and form uniform angles.

Primes and squares

A Pell prime is a Pell number that is prime number, prime. The first few Pell primes are :2, 5, 29, 5741, 33461, 44560482149, 1746860020068409, 68480406462161287469, ... . The indices of these primes within the sequence of all Pell numbers are :2, 3, 5, 11, 13, 29, 41, 53, 59, 89, 97, 101, 167, 181, 191, 523, 929, 1217, 1301, 1361, 2087, 2273, 2393, 8093, ... These indices are all themselves prime. As with the Fibonacci numbers, a Pell number ''P''''n'' can only be prime if ''n'' itself is prime, because if ''d'' is a divisor of ''n'' then ''P''''d'' is a divisor of ''P''''n''. The only Pell numbers that are squares, cubes, or any higher power of an integer are 0, 1, and 169 = 132. However, despite having so few squares or other powers, Pell numbers have a close connection to square triangular numbers.Sesskin (1962). See the square triangular number article for a more detailed derivation. Specifically, these numbers arise from the following identity of Pell numbers: :\bigl(\left(P_+P_k\right)\cdot P_k\bigr)^2 = \frac. The left side of this identity describes a square number, while the right side describes a triangular number, so the result is a square triangular number. Santana and Diaz-Barrero (2006) proved another identity relating Pell numbers to squares and showing that the sum of the Pell numbers up to ''P''4''n''+1 is always a square: :\sum_^ P_i = \left(\sum_^n 2^r\right)^2 = \left(P_+P_\right)^2. For instance, the sum of the Pell numbers up to ''P''5, , is the square of . The numbers forming the square roots of these sums, :1, 7, 41, 239, 1393, 8119, 47321,… , are known as the Newman–Shanks–Williams number, Newman–Shanks–Williams (NSW) numbers.

Pythagorean triples

If a right triangle has integer side lengths ''a'', ''b'', ''c'' (necessarily satisfying the Pythagorean theorem ), then (''a'',''b'',''c'') is known as a Pythagorean triple. As Martin (1875) describes, the Pell numbers can be used to form Pythagorean triples in which ''a'' and ''b'' are one unit apart, corresponding to right triangles that are nearly isosceles. Each such triple has the form :\left(2P_P_, P_^2 - P_^2, P_^2 + P_^2=P_\right). The sequence of Pythagorean triples formed in this way is :(4,3,5), (20,21,29), (120,119,169), (696,697,985),…

Pell–Lucas numbers

The companion Pell numbers or Pell–Lucas numbers are defined by the recurrence relation :Q_n=\begin2&\mboxn=0;\\2&\mboxn=1;\\2Q_+Q_&\mbox\end In words: the first two numbers in the sequence are both 2, and each successive number is formed by adding twice the previous Pell–Lucas number to the Pell–Lucas number before that, or equivalently, by adding the next Pell number to the previous Pell number: thus, 82 is the companion to 29, and The first few terms of the sequence are : 2 (number), 2, 2 (number), 2, 6 (number), 6, 14 (number), 14, 34 (number), 34, 82 (number), 82, 198 (number), 198, 478 (number), 478,… Like the relationship between Fibonacci numbers and Lucas numbers, :Q_n=\frac for all natural numbers ''n''. The companion Pell numbers can be expressed by the closed form formula :Q_n=\left(1+\sqrt 2\right)^n+\left(1-\sqrt 2\right)^n. These numbers are all even; each such number is twice the numerator in one of the rational approximations to \scriptstyle\sqrt 2 discussed above. Like the Lucas sequence, if a Pell–Lucas number ''Qn'' is prime, it is necessary that n be either prime or a power of 2. The Pell–Lucas primes are :3, 7, 17, 41, 239, 577,… . For these ''n'' are :2, 3, 4, 5, 7, 8, 16, 19, 29, 47, 59, 163, 257, 421,… .

Computations and connections

The following table gives the first few powers of the silver ratio ''δ'' = ''δ''S = 1 +  and its conjugate = 1 − . : The coefficients are the half-companion Pell numbers ''Hn'' and the Pell numbers ''Pn'' which are the (non-negative) solutions to . A square triangular number is a number :N=\frac=s^2, which is both the ''t''th triangular number and the ''s''th square number. A ''near-isosceles Pythagorean triple'' is an integer solution to where . The next table shows that splitting the odd number ''Hn'' into nearly equal halves gives a square triangular number when ''n'' is even and a near isosceles Pythagorean triple when n is odd. All solutions arise in this manner. :


The half-companion Pell numbers ''Hn'' and the Pell numbers ''Pn'' can be derived in a number of easily equivalent ways.

Raising to powers

:\left(1+\sqrt2\right)^n=H_n+P_n\sqrt :\left(1-\sqrt2\right)^n=H_n-P_n\sqrt. From this it follows that there are ''closed forms'': :H_n=\frac. and :P_n\sqrt2=\frac.

Paired recurrences

:H_n=\begin1&\mboxn=0;\\H_+2P_&\mbox\end :P_n=\begin0&\mboxn=0;\\H_+P_&\mbox\end

Reciprocal recurrence formulas

Let n be at least 2. :H_n=(3P_n-P_)/2=3P_+P_; :P_n=(3H_n-H_)/4=(3H_+H_)/2.

Matrix formulations

:\begin H_n \\ P_n \end = \begin 1 & 2 \\ 1 & 1 \end \begin H_ \\ P_ \end = \begin 1 & 2 \\ 1 & 1 \end^n \begin 1 \\ 0 \end. So : \begin H_n & 2P_n \\ P_n & H_n \end= \begin 1 & 2 \\ 1 & 1 \end^n .


The difference between ''Hn'' and ''Pn'' is :\left(1-\sqrt2\right)^n \approx (-0.41421)^n, which goes rapidly to zero. So :\left(1+\sqrt2\right)^n=H_n+P_n\sqrt2\, is extremely close to 2''Hn''. From this last observation it follows that the integer ratios ' rapidly approach ; and and rapidly approach 1 + .

''H''2 − 2''P''2 = ±1

Since is irrational, we cannot have ' = , i.e., :\frac=\frac. The best we can achieve is either :\frac=\frac\quad \mbox \quad \frac=\frac. The (non-negative) solutions to are exactly the pairs with ''n'' even, and the solutions to are exactly the pairs with ''n'' odd. To see this, note first that :H_^2-2P_^2=\left(H_n+2P_n\right)^2-2\left(H_n+P_n\right)^2=-\left(H_n^2-2P_n^2\right), so that these differences, starting with , are alternately 1 and −1. Then note that every positive solution comes in this way from a solution with smaller integers since :(2P-H)^2-2(H-P)^2=-\left(H^2-2P^2\right). The smaller solution also has positive integers, with the one exception: which comes from ''H''0 = 1 and ''P''0 = 0.

Square triangular numbers

The required equation :\frac=s^2\, is equivalent to:4t^2+4t+1=8s^2+1, which becomes with the substitutions ''H'' = 2''t'' + 1 and ''P'' = 2''s''. Hence the ''n''th solution is :t_n=\frac \quad \mbox \quad s_n=\frac. Observe that ''t'' and ''t'' + 1 are relatively prime, so that  = ''s''2 happens exactly when they are adjacent integers, one a square ''H''2 and the other twice a square 2''P''2. Since we know all solutions of that equation, we also have :t_n=\begin2P_n^2&\mboxn\mbox;\\H_^2&\mboxn\mbox\end and s_n=H_nP_n. This alternate expression is seen in the next table. :

Pythagorean triples

The equality occurs exactly when which becomes with the substitutions and . Hence the ''n''th solution is and . The table above shows that, in one order or the other, ''an'' and are and while .



* * * * * * * * * * * * * * * * * * *

External links

* * —The numerators of the same sequence of approximations {{series (mathematics) Integer sequences Recurrence relations Unsolved problems in mathematics