- Source: 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.
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:
P
n
=
{
0
if
n
=
0
;
1
if
n
=
1
;
2
P
n
−
1
+
P
n
−
2
otherwise.
{\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, plus 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 the OEIS).
Analogously to the Binet formula, the Pell numbers can also be expressed by the closed form formula
P
n
=
(
1
+
2
)
n
−
(
1
−
2
)
n
2
2
.
{\displaystyle P_{n}={\frac {\left(1+{\sqrt {2}}\right)^{n}-\left(1-{\sqrt {2}}\right)^{n}}{2{\sqrt {2}}}}.}
For large values of n, the (1 + √2)n term dominates this expression, so the Pell numbers are approximately proportional to powers of the silver ratio 1 + √2, analogous to the growth rate of Fibonacci numbers as powers of the golden ratio.
A third definition is possible, from the matrix formula
(
P
n
+
1
P
n
P
n
P
n
−
1
)
=
(
2
1
1
0
)
n
.
{\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,
P
n
+
1
P
n
−
1
−
P
n
2
=
(
−
1
)
n
,
{\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).
Approximation to the square root of two
Pell numbers arise historically and most notably in the rational approximation to √2. If two large integers x and y form a solution to the Pell equation
x
2
−
2
y
2
=
±
1
,
{\displaystyle x^{2}-2y^{2}=\pm 1,}
then their ratio x/y provides a close approximation to √2. The sequence of approximations of this form is
1
1
,
3
2
,
7
5
,
17
12
,
41
29
,
99
70
,
…
{\displaystyle {\frac {1}{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
P
n
−
1
+
P
n
P
n
.
{\displaystyle {\frac {P_{n-1}+P_{n}}{P_{n}}}.}
The approximation
2
≈
577
408
{\displaystyle {\sqrt {2}}\approx {\frac {577}{408}}}
of this type was known to Indian mathematicians in the third or fourth century BCE. The Greek mathematicians of the fifth century BCE also knew of this sequence of approximations: Plato refers to the numerators as rational diameters. In the second 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
2
{\displaystyle {\sqrt {2}}}
:
2
=
1
+
1
2
+
1
2
+
1
2
+
1
2
+
1
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,
577
408
=
1
+
1
2
+
1
2
+
1
2
+
1
2
+
1
2
+
1
2
+
1
2
.
{\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 √2 allows them to be used for accurate rational approximations to a regular octagon with vertex coordinates (± Pi, ± Pi +1) and (± Pi +1, ± Pi ). All vertices are equally distant from the origin, and form nearly uniform angles around the origin. Alternatively, the points
(
±
(
P
i
+
P
i
−
1
)
,
0
)
{\displaystyle (\pm (P_{i}+P_{i-1}),0)}
,
(
0
,
±
(
P
i
+
P
i
−
1
)
)
{\displaystyle (0,\pm (P_{i}+P_{i-1}))}
, and
(
±
P
i
,
±
P
i
)
{\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, 33461, 44560482149, 1746860020068409, 68480406462161287469, ... (sequence A086383 in the OEIS).
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, ... (sequence A096650 in the OEIS)
These indices are all themselves prime. As with the Fibonacci numbers, a Pell number Pn can only be prime if n itself is prime, because if d is a divisor of n then Pd is a divisor of Pn.
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. Specifically, these numbers arise from the following identity of Pell numbers:
(
(
P
k
−
1
+
P
k
)
⋅
P
k
)
2
=
(
P
k
−
1
+
P
k
)
2
⋅
(
(
P
k
−
1
+
P
k
)
2
−
(
−
1
)
k
)
2
.
{\displaystyle {\bigl (}\left(P_{k-1}+P_{k}\right)\cdot P_{k}{\bigr )}^{2}={\frac {\left(P_{k-1}+P_{k}\right)^{2}\cdot \left(\left(P_{k-1}+P_{k}\right)^{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.
Falcón and Díaz-Barrero (2006) proved another identity relating Pell numbers to squares and showing that the sum of the Pell numbers up to P4n +1 is always a square:
∑
i
=
0
4
n
+
1
P
i
=
(
∑
r
=
0
n
2
r
(
2
n
+
1
2
r
)
)
2
=
(
P
2
n
+
P
2
n
+
1
)
2
.
{\displaystyle \sum _{i=0}^{4n+1}P_{i}=\left(\sum _{r=0}^{n}2^{r}{2n+1 \choose 2r}\right)^{\!2}=\left(P_{2n}+P_{2n+1}\right)^{2}.}
For instance, the sum of the Pell numbers up to P5, 0 + 1 + 2 + 5 + 12 + 29 = 49, is the square of P2 + P3 = 2 + 5 = 7. The numbers P2n + P2n +1 forming the square roots of these sums,
1, 7, 41, 239, 1393, 8119, 47321, … (sequence A002315 in the OEIS),
are known as the Newman–Shanks–Williams (NSW) numbers.
Pythagorean triples
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
(
2
P
n
P
n
+
1
,
P
n
+
1
2
−
P
n
2
,
P
n
+
1
2
+
P
n
2
=
P
2
n
+
1
)
.
{\displaystyle \left(2P_{n}P_{n+1},P_{n+1}^{2}-P_{n}^{2},P_{n+1}^{2}+P_{n}^{2}=P_{2n+1}\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
=
{
2
if
n
=
0
;
2
if
n
=
1
;
2
Q
n
−
1
+
Q
n
−
2
otherwise.
{\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 the OEIS): 2, 2, 6, 14, 34, 82, 198, 478, …
Like the relationship between Fibonacci numbers and Lucas numbers,
Q
n
=
P
2
n
P
n
{\displaystyle Q_{n}={\frac {P_{2n}}{P_{n}}}}
for all natural numbers n.
The companion Pell numbers can be expressed by the closed form formula
Q
n
=
(
1
+
2
)
n
+
(
1
−
2
)
n
.
{\displaystyle 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
2
{\displaystyle {\sqrt {2}}}
discussed above.
Like the Lucas sequence, if a Pell–Lucas number 1/2Qn 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 the OEIS).
For these n are
2, 3, 4, 5, 7, 8, 16, 19, 29, 47, 59, 163, 257, 421, … (sequence A099088 in the OEIS).
Computations and connections
The following table gives the first few powers of the silver ratio δ = δ S = 1 + √2 and its conjugate δ = 1 − √2.
The coefficients are the half-companion Pell numbers Hn and the Pell numbers Pn which are the (non-negative) solutions to H 2 − 2P 2 = ±1.
A square triangular number is a number
N
=
t
(
t
+
1
)
2
=
s
2
,
{\displaystyle N={\frac {t(t+1)}{2}}=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 a 2 + b 2 = c 2 where a + 1 = b.
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.
= Definitions
=The half-companion Pell numbers Hn and the Pell numbers Pn can be derived in a number of easily equivalent ways.
Raising to powers
(
1
+
2
)
n
=
H
n
+
P
n
2
{\displaystyle \left(1+{\sqrt {2}}\right)^{n}=H_{n}+P_{n}{\sqrt {2}}}
(
1
−
2
)
n
=
H
n
−
P
n
2
.
{\displaystyle \left(1-{\sqrt {2}}\right)^{n}=H_{n}-P_{n}{\sqrt {2}}.}
From this it follows that there are closed forms:
H
n
=
(
1
+
2
)
n
+
(
1
−
2
)
n
2
.
{\displaystyle H_{n}={\frac {\left(1+{\sqrt {2}}\right)^{n}+\left(1-{\sqrt {2}}\right)^{n}}{2}}.}
and
P
n
2
=
(
1
+
2
)
n
−
(
1
−
2
)
n
2
.
{\displaystyle P_{n}{\sqrt {2}}={\frac {\left(1+{\sqrt {2}}\right)^{n}-\left(1-{\sqrt {2}}\right)^{n}}{2}}.}
Paired recurrences
H
n
=
{
1
if
n
=
0
;
H
n
−
1
+
2
P
n
−
1
otherwise.
{\displaystyle H_{n}={\begin{cases}1&{\mbox{if }}n=0;\\H_{n-1}+2P_{n-1}&{\mbox{otherwise.}}\end{cases}}}
P
n
=
{
0
if
n
=
0
;
H
n
−
1
+
P
n
−
1
otherwise.
{\displaystyle P_{n}={\begin{cases}0&{\mbox{if }}n=0;\\H_{n-1}+P_{n-1}&{\mbox{otherwise.}}\end{cases}}}
Reciprocal recurrence formulas
Let n be at least 2.
H
n
=
(
3
P
n
−
P
n
−
2
)
/
2
=
3
P
n
−
1
+
P
n
−
2
;
{\displaystyle H_{n}=(3P_{n}-P_{n-2})/2=3P_{n-1}+P_{n-2};}
P
n
=
(
3
H
n
−
H
n
−
2
)
/
4
=
(
3
H
n
−
1
+
H
n
−
2
)
/
2.
{\displaystyle P_{n}=(3H_{n}-H_{n-2})/4=(3H_{n-1}+H_{n-2})/2.}
Matrix formulations
(
H
n
P
n
)
=
(
1
2
1
1
)
(
H
n
−
1
P
n
−
1
)
=
(
1
2
1
1
)
n
(
1
0
)
.
{\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
(
H
n
2
P
n
P
n
H
n
)
=
(
1
2
1
1
)
n
.
{\displaystyle {\begin{pmatrix}H_{n}&2P_{n}\\P_{n}&H_{n}\end{pmatrix}}={\begin{pmatrix}1&2\\1&1\end{pmatrix}}^{n}.}
= Approximations
=The difference between Hn and Pn√2 is
(
1
−
2
)
n
≈
(
−
0.41421
)
n
,
{\displaystyle \left(1-{\sqrt {2}}\right)^{n}\approx (-0.41421)^{n},}
which goes rapidly to zero. So
(
1
+
2
)
n
=
H
n
+
P
n
2
{\displaystyle \left(1+{\sqrt {2}}\right)^{n}=H_{n}+P_{n}{\sqrt {2}}}
is extremely close to 2Hn.
From this last observation it follows that the integer ratios Hn/Pn rapidly approach √2; and Hn/Hn −1 and Pn/Pn −1 rapidly approach 1 + √2.
= H 2 − 2P 2 = ±1
=Since √2 is irrational, we cannot have H/P = √2, i.e.,
H
2
P
2
=
2
P
2
P
2
.
{\displaystyle {\frac {H^{2}}{P^{2}}}={\frac {2P^{2}}{P^{2}}}.}
The best we can achieve is either
H
2
P
2
=
2
P
2
−
1
P
2
or
H
2
P
2
=
2
P
2
+
1
P
2
.
{\displaystyle {\frac {H^{2}}{P^{2}}}={\frac {2P^{2}-1}{P^{2}}}\quad {\mbox{or}}\quad {\frac {H^{2}}{P^{2}}}={\frac {2P^{2}+1}{P^{2}}}.}
The (non-negative) solutions to H 2 − 2P 2 = 1 are exactly the pairs (Hn, Pn) with n even, and the solutions to H 2 − 2P 2 = −1 are exactly the pairs (Hn, Pn) with n odd. To see this, note first that
H
n
+
1
2
−
2
P
n
+
1
2
=
(
H
n
+
2
P
n
)
2
−
2
(
H
n
+
P
n
)
2
=
−
(
H
n
2
−
2
P
n
2
)
,
{\displaystyle H_{n+1}^{2}-2P_{n+1}^{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 H 2 0 − 2P 2 0 = 1, are alternately
1 and −1. Then note that every positive solution comes in this way from a solution with smaller integers since
(
2
P
−
H
)
2
−
2
(
H
−
P
)
2
=
−
(
H
2
−
2
P
2
)
.
{\displaystyle (2P-H)^{2}-2(H-P)^{2}=-\left(H^{2}-2P^{2}\right).}
The smaller solution also has positive integers, with the one exception: H = P = 1 which comes from H0 = 1 and P0 = 0.
= Square triangular numbers
=The required equation
t
(
t
+
1
)
2
=
s
2
{\displaystyle {\frac {t(t+1)}{2}}=s^{2}}
is equivalent to
4
t
2
+
4
t
+
1
=
8
s
2
+
1
,
{\displaystyle 4t^{2}+4t+1=8s^{2}+1,}
which becomes H 2 = 2P 2 + 1 with the substitutions H = 2t + 1 and P = 2s. Hence the n-th solution is
t
n
=
H
2
n
−
1
2
and
s
n
=
P
2
n
2
.
{\displaystyle t_{n}={\frac {H_{2n}-1}{2}}\quad {\mbox{and}}\quad s_{n}={\frac {P_{2n}}{2}}.}
Observe that t and t + 1 are relatively prime, so that t (t + 1)/2 = s 2 happens exactly when they are adjacent integers, one a square H 2 and the other twice a square 2P 2. Since we know all solutions of that equation, we also have
t
n
=
{
2
P
n
2
if
n
is even
;
H
n
2
if
n
is odd.
{\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}}}
and
s
n
=
H
n
P
n
.
{\displaystyle s_{n}=H_{n}P_{n}.}
This alternate expression is seen in the next table.
= Pythagorean triples
=The equality c 2 = a 2 + (a + 1) 2 = 2a 2 + 2a + 1 occurs exactly when 2c 2 = 4a 2 + 4a + 2 which becomes 2P 2 = H 2 + 1 with the substitutions H = 2a + 1 and P = c. Hence the n-th solution is an = H2n +1 − 1/2 and cn = P2n +1.
The table above shows that, in one order or the other, an and bn = an + 1 are Hn Hn +1 and 2Pn Pn +1 while cn = Hn +1 Pn + Pn +1 Hn.
Notes
References
External links
Weisstein, Eric W. "Pell Number". MathWorld.
OEIS sequence A001333 (Numerators of continued fraction convergents to sqrt(2))—The numerators of the same sequence of approximations
Kata Kunci Pencarian:
- 1.000.000
- Daftar bilangan prima
- Teori bilangan
- Identitas Brahmagupta–Fibonacci
- Bilangan kuasa penuh
- Bentuk kuadrat biner
- Paus Fransiskus
- Ganesa
- 900 (angka)
- Rangkap tiga Pythagoras
- Pell number
- 198 (number)
- 82 (number)
- 1,000,000
- 1,000,000,000
- Pell Grant
- 10,000,000
- 900 (number)
- 400 (number)
- 100,000
