Pell number

In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins 1/1, 3/2, 7/5, 17/12, and 41/29, 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 grow exponentially, proportionally to powers of the silver ratio 1 + √2. 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.[1]

As with Pell's equation, the name of the Pell numbers stems from 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

${\displaystyle P_{n}={\begin{cases}0&{\mbox{if }}n=0;\\1&{\mbox{if }}n=1;\\2P_{n-1}+P_{n-2}&{\mbox{otherwise.}}\end{cases}}}$

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, ... (sequence A000129 in OEIS).

The Pell numbers can also be expressed by the closed form formula

${\displaystyle P_{n}={\frac {(1+{\sqrt {2}})^{n}-(1-{\sqrt {2}})^{n}}{2{\sqrt {2}}}}.}$

For large values of n, the ${\displaystyle \scriptstyle (1+{\sqrt {2}})^{n}}$ term dominates this expression, so the Pell numbers are approximately proportional to powers of the silver ratio ${\displaystyle \scriptstyle (1+{\sqrt {2}})}$, analogous to the growth rate of Fibonacci numbers as powers of the golden ratio.

A third definition is possible, from the matrix formula

${\displaystyle {\begin{pmatrix}P_{n+1}&P_{n}\\P_{n}&P_{n-1}\end{pmatrix}}={\begin{pmatrix}2&1\\1&0\end{pmatrix}}^{n}.}$

Many identities can be derived or proven from these definitions; for instance an identity analogous to Cassini's identity for Fibonacci numbers,

${\displaystyle P_{n+1}P_{n-1}-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).[2]

Approximation to the square root of two

Rational approximations to regular octagons, with coordinates derived from the Pell numbers.

Pell numbers arise historically and most notably in the rational approximation to the square root of 2. If two large integers x and y form a solution to the Pell equation

${\displaystyle \displaystyle x^{2}-2y^{2}=\pm 1,}$

then their ratio ${\displaystyle {\tfrac {x}{y}}}$ provides a close approximation to ${\displaystyle \scriptstyle {\sqrt {2}}}$. The sequence of approximations of this form is

${\displaystyle 1,{\frac {3}{2}},{\frac {7}{5}},{\frac {17}{12}},{\frac {41}{29}},{\frac {99}{70}},\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 ${\displaystyle {\tfrac {P_{n-1}+P_{n}}{P_{n}}}}$. The approximation

${\displaystyle {\sqrt {2}}\approx {\frac {577}{408}}}$

of this type was known to Indian mathematicians in the third or fourth century B.C.[3] The Greek mathematicians of the fifth century B.C. also knew of this sequence of approximations:[4] Plato refers to the numerators as rational diameters.[5] 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.[6]

These approximations can be derived from the continued fraction expansion of ${\displaystyle \scriptstyle {\sqrt {2}}}$:

${\displaystyle {\sqrt {2}}=1+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+\ddots \,}}}}}}}}}}.}$

Truncating this expansion to any number of terms produces one of the Pell-number-based approximations in this sequence; for instance,

${\displaystyle {\frac {577}{408}}=1+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2+{\cfrac {1}{2}}}}}}}}}}}}}}.}$

As Knuth (1994) describes, the fact that Pell numbers approximate ${\displaystyle \scriptstyle {\sqrt {2}}}$ allows them to be used for accurate rational approximations to a regular octagon with vertex coordinates ${\displaystyle (\pm P_{i},\pm P_{i+1})}$ and ${\displaystyle (\pm P_{i+1},\pm P_{i})}$. All vertices are equally distant from the origin, and form nearly uniform angles around the origin. Alternatively, the points ${\displaystyle (\pm (P_{i}+P_{i-1}),0)}$, ${\displaystyle (0,\pm (P_{i}+P_{i-1}))}$, and ${\displaystyle (\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. The first few Pell primes are

2, 5, 29, 5741, ... (sequence A086383 in OEIS).

For these ns are

2, 3, 5, 11, 13, 29, 41, 53, 59, 89, 97, 101, 167, 181, 191, ... (sequence A096650 in OEIS)

As with the Fibonacci numbers, a Pell number ${\displaystyle P_{n}}$ can only be prime if n itself is prime, because if and only if a divides b, then ${\displaystyle P_{a}}$ divides ${\displaystyle P_{b}}$.

If and only if a prime p congruent to 1 or 7 (mod 8), then p divides Pp-1, otherwise, p divides Pp+1. (The only exception is p = 2, if and only if p = 2, then p divides Pp)

The only Pell numbers that are squares, cubes, or any higher power of an integer are 0, 1, and 169 = 132.[7]

However, despite having so few squares or other powers, Pell numbers have a close connection to square triangular numbers.[8] Specifically, these numbers arise from the following identity of Pell numbers:

${\displaystyle {\bigl (}(P_{k-1}+P_{k})\cdot P_{k}{\bigr )}^{2}={\frac {(P_{k-1}+P_{k})^{2}\cdot \left((P_{k-1}+P_{k})^{2}-(-1)^{k}\right)}{2}}.}$

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) prove another identity relating Pell numbers to squares and showing that the sum of the Pell numbers up to ${\displaystyle P_{4n+1}}$ is always a square:

${\displaystyle \sum _{i=0}^{4n+1}P_{i}=\left(\sum _{r=0}^{n}2^{r}{2n+1 \choose 2r}\right)^{2}=(P_{2n}+P_{2n+1})^{2}.}$

For instance, the sum of the Pell numbers up to ${\displaystyle P_{5}}$, ${\displaystyle 0+1+2+5+12+29=49}$, is the square of ${\displaystyle P_{2}+P_{3}=2+5=7}$. The numbers ${\displaystyle P_{2n}+P_{2n+1}}$ forming the square roots of these sums,

1, 7, 41, 239, 1393, 8119, 47321, ... (sequence A002315 in OEIS),

are known as the Newman–Shanks–Williams (NSW) numbers.

Pythagorean triples

Integer right triangles with nearly equal legs, derived from the Pell numbers.

If a right triangle has integer side lengths a, b, c (necessarily satisfying the Pythagorean theorem a2+b2=c2), 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

${\displaystyle (2P_{n}P_{n+1},P_{n+1}^{2}-P_{n}^{2},P_{n+1}^{2}+P_{n}^{2}=P_{2n+1}).}$

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

${\displaystyle Q_{n}={\begin{cases}2&{\mbox{if }}n=0;\\2&{\mbox{if }}n=1;\\2Q_{n-1}+Q_{n-2}&{\mbox{otherwise.}}\end{cases}}}$

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 82 = 2 * 34 + 14 = 70 + 12. The first few terms of the sequence are (sequence A002203 in OEIS): 2, 2, 6, 14, 34, 82, 198, 478...

Like the Fibonacci number to Lucas number, ${\displaystyle Q_{n}={\frac {P_{2n}}{P_{n}}}}$ for all natural number n.

The companion Pell numbers can be expressed by the closed form formula

${\displaystyle Q_{n}=(1+{\sqrt {2}})^{n}+(1-{\sqrt {2}})^{n}.}$

These numbers are all even; each such number is twice the numerator in one of the rational approximations to ${\displaystyle \scriptstyle {\sqrt {2}}}$ discussed above.

Like the Lucas sequence, if a Pell-Lucas number ${\displaystyle {\frac {Q_{n}}{2}}}$ 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, ... (sequence A086395 in OEIS).

For these ns are

2, 3, 4, 5, 7, 8, 16, 19, 29, 47, 59, 163, 257, 421, ... (sequence A099088 in OEIS).

Computations and connections

The following table gives the first few powers of the silver ratio ${\displaystyle \delta =\delta _{S}=1+{\sqrt {2}}}$ and its conjugate ${\displaystyle {\bar {\delta }}=1-{\sqrt {2}}}$.

The coefficients are the half companion Pell numbers ${\displaystyle H_{n}}$ and the Pell numbers ${\displaystyle P_{n}}$ which are the (non-negative) solutions to ${\displaystyle H^{2}-2P^{2}=\pm 1}$. A square triangular number is a number ${\displaystyle N={\frac {t(t+1)}{2}}=s^{2}}$ which is both the ${\displaystyle t\,}$th triangular number and the ${\displaystyle s\,}$th square number. A near isosceles Pythagorean triple is an integer solution to ${\displaystyle a^{2}+b^{2}=c^{2}}$ where ${\displaystyle a+1=b}$.

The next table shows that splitting the odd number ${\displaystyle H_{n}}$ 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.

 ${\displaystyle n}$ ${\displaystyle H_{n}}$ ${\displaystyle P_{n}}$ t t+1 s a b c 0 1 0 0 0 0 1 1 1 0 1 1 2 3 2 1 2 1 3 7 5 3 4 5 4 17 12 8 9 6 5 41 29 20 21 29 6 99 70 49 50 35 7 239 169 119 120 169 8 577 408 288 289 204 9 1393 985 696 697 985 10 3363 2378 1681 1682 1189 11 8119 5741 4059 4060 5741 12 19601 13860 9800 9801 6930

Definitions

The half companion Pell Numbers ${\displaystyle H_{n}}$ and the Pell numbers ${\displaystyle P_{n}}$ can be derived in a number of easily equivalent ways:

Raising to powers:

${\displaystyle (1+{\sqrt {2}})^{n}=H_{n}+P_{n}{\sqrt {2}}}$
${\displaystyle (1-{\sqrt {2}})^{n}=H_{n}-P_{n}{\sqrt {2}}.}$

From this it follows that there are closed forms:

${\displaystyle H_{n}={\frac {(1+{\sqrt {2}})^{n}+(1-{\sqrt {2}})^{n}}{2}}.}$

and

${\displaystyle P_{n}{\sqrt {2}}={\frac {(1+{\sqrt {2}})^{n}-(1-{\sqrt {2}})^{n}}{2}}.}$

Paired recurrences:

${\displaystyle H_{n}={\begin{cases}1&{\mbox{if }}n=0;\\H_{n-1}+2P_{n-1}&{\mbox{otherwise.}}\end{cases}}}$
${\displaystyle P_{n}={\begin{cases}0&{\mbox{if }}n=0;\\H_{n-1}+P_{n-1}&{\mbox{otherwise.}}\end{cases}}}$

and matrix formulations:

${\displaystyle {\begin{pmatrix}H_{n}\\P_{n}\end{pmatrix}}={\begin{pmatrix}1&2\\1&1\end{pmatrix}}{\begin{pmatrix}H_{n-1}\\P_{n-1}\end{pmatrix}}={\begin{pmatrix}1&2\\1&1\end{pmatrix}}^{n}{\begin{pmatrix}1\\0\end{pmatrix}}.}$

So

${\displaystyle {\begin{pmatrix}H_{n}&2P_{n}\\P_{n}&H_{n}\end{pmatrix}}={\begin{pmatrix}1&2\\1&1\end{pmatrix}}^{n}.}$

Approximations

From this last observation it follows that the integer ratios ${\displaystyle {\frac {H_{n}}{P_{n}}}}$ rapidly approach ${\displaystyle {\sqrt {2}}\,}$ while ${\displaystyle {\frac {H_{n}}{H_{n-1}}}\,}$ and ${\displaystyle {\frac {P_{n}}{P_{n-1}}}\,}$ rapidly approach ${\displaystyle 1+{\sqrt {2}}\,}$.

H2 − 2P2 = ±1

The (non-negative) solutions to ${\displaystyle H^{2}-2P^{2}=1\,}$ are exactly the pairs ${\displaystyle H_{n},P_{n}{\mbox{ with }}n\,}$ even and the solutions to ${\displaystyle H^{2}-2P^{2}=-1\,}$ are exactly the pairs ${\displaystyle H_{n},P_{n}{\mbox{ with }}n\,}$ odd. To see this, note first that

${\displaystyle H_{n+1}^{2}-2P_{n+1}^{2}=(H_{n}+2P_{n})^{2}-2(H_{n}+P_{n})^{2}=-(H_{n}^{2}-2P_{n}^{2})\,}$

so that these differences, starting with ${\displaystyle H_{0}^{2}-2P_{0}^{2}=1\,}$ are alternately ${\displaystyle 1{\mbox{ and }}-1\,}$. Then note that every positive solution comes in this way from a solution with smaller integers since ${\displaystyle (2P-H)^{2}-2(H-P)^{2}=-(H^{2}-2P^{2})\,}$. The smaller solution also has positive integers with the one exception ${\displaystyle H=P=1\,}$ which comes from ${\displaystyle H_{0}=1{\mbox{ and }}P_{0}=0\,}$.

Square triangular numbers

{{#invoke:main|main}} The required equation ${\displaystyle {\frac {t(t+1)}{2}}=s^{2}\,}$ is equivalent to ${\displaystyle 4t^{2}+4t+1=8s^{2}+1\,}$ which becomes ${\displaystyle H^{2}=2P^{2}+1}$ with the substitutions ${\displaystyle H=2t+1{\mbox{ and }}P=2s}$. Hence the nth solution is ${\displaystyle t_{n}={\frac {H_{2n}-1}{2}}}$ and ${\displaystyle s_{n}={\frac {P_{2n}}{2}}.}$

Observe that ${\displaystyle t}$ and ${\displaystyle t+1}$ are relatively prime so that ${\displaystyle {\frac {t(t+1)}{2}}=s^{2}\,}$ happens exactly when they are adjacent integers, one a square ${\displaystyle H^{2}}$ and the other twice a square ${\displaystyle 2P^{2}}$. Since we know all solutions of that equation, we also have

${\displaystyle t_{n}={\begin{cases}2P_{n}^{2}&{\mbox{if }}n{\mbox{ is even}};\\H_{n}^{2}&{\mbox{if }}n{\mbox{ is odd.}}\end{cases}}}$

This alternate expression is seen in the next table.

 ${\displaystyle n}$ ${\displaystyle H_{n}}$ ${\displaystyle P_{n}}$ t t+1 s a b c 0 1 0 1 1 1 1 2 1 3 4 5 2 3 2 8 9 6 21 20 29 3 7 5 49 50 35 119 120 169 4 17 12 288 289 204 697 696 985 5 41 29 1681 1682 1189 4059 4060 5741 6 99 70 9800 9801 6930 23661 23660 33461

Notes

1. For instance, Sellers (2002) proves that the number of perfect matchings in the Cartesian product of a path graph and the graph K4-e can be calculated as the product of a Pell number with the corresponding Fibonacci number.
2. For the matrix formula and its consequences see Ercolano (1979) and Kilic and Tasci (2005). Additional identities for the Pell numbers are listed by Horadam (1971) and Bicknell (1975).
3. As recorded in the Shulba Sutras; see e.g. Dutka (1986), who cites Thibaut (1875) for this information.
4. See Knorr (1976) for the fifth century date, which matches Proclus' claim that the side and diameter numbers were discovered by the Pythagoreans. For more detailed exploration of later Greek knowledge of these numbers see Thompson (1929), Vedova (1951), Ridenhour (1986), Knorr (1998), and Filep (1999).
5. For instance, as several of the references from the previous note observe, in Plato's Republic there is a reference to the "rational diameter of 5", by which Plato means 7, the numerator of the approximation 7/5 of which 5 is the denominator.
6. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
7. Pethő (1992); Cohn (1996). Although the Fibonacci numbers are defined by a very similar recurrence to the Pell numbers, Cohn writes that an analogous result for the Fibonacci numbers seems much more difficult to prove. (However, this was proven in 2006 by Bugeaud et al.)
8. Sesskin (1962). See the square triangular number article for a more detailed derivation.

References

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:citation/CS1|citation

|CitationClass=conference }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

• {{#invoke:Citation/CS1|citation

|CitationClass=journal }} Template:Refend