Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Pell number

From Wikipedia, the free encyclopedia
(Redirected fromPell prime)
Number used to approximate the square root of 2
Not to be confused withBell number.
The sides of thesquares used to construct a silver spiral are the Pell numbers

Inmathematics, thePell numbers are an infinitesequence of integers, known since ancient times, that comprise thedenominators of theclosest rational approximations to thesquare root of 2. Thissequence of approximations begins1/1,3/2,7/5,17/12, and41/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 thecompanion Pell numbers orPell–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 arecurrence relation similar to that for theFibonacci numbers, and both sequences of numbersgrow exponentially, proportionally to powers of thesilver ratio 1 + 2. As well as being used to approximate the square root of two, Pell numbers can be used to findsquare triangular numbers, to constructinteger approximations to theright isosceles triangle, and to solve certaincombinatorial enumeration problems.[1]

As withPell's equation, the name of the Pell numbers stems fromLeonhard Euler's mistaken attribution of the equation and the numbers derived from it toJohn 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 areLucas sequences.

Pell numbers

[edit]

The Pell numbers are defined by therecurrence relation:

Pn={0if n=0;1if n=1;2Pn1+Pn2otherwise.{\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, … (sequenceA000129 in theOEIS).

Analogously to theBinet formula, the Pell numbers can also be expressed by the closed form formula

Pn=(1+2)n(12)n22.{\displaystyle P_{n}={\frac {\left(1+{\sqrt {2}}\right)^{n}-\left(1-{\sqrt {2}}\right)^{n}}{2{\sqrt {2}}}}.}For large values ofn, the(1 +2)n term dominates this expression, so the Pell numbers are approximately proportional to powers of thesilver ratio1 +2, analogous to the growth rate of Fibonacci numbers as powers of thegolden ratio.

A third definition is possible, from thematrix formula

(Pn+1PnPnPn1)=(2110)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}.}

Manyidentities can be derived orproven from these definitions; for instance an identity analogous toCassini's identity for Fibonacci numbers,

Pn+1Pn1Pn2=(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 thedeterminants of the matrices on the left and right sides of the matrix formula).[2]

Approximation to the square root of two

[edit]
Rational approximations toregularoctagons, with coordinates derived from the Pell numbers.

Pell numbers arise historically and most notably in therational approximation to2. If two large integersx andy form a solution to thePell equation

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

then their ratiox/y provides a close approximation to2. The sequence of approximations of this form is

11,32,75,1712,4129,9970,{\displaystyle {\frac {1}{1}},{\frac {3}{2}},{\frac {7}{5}},{\frac {17}{12}},{\frac {41}{29}},{\frac {99}{70}},\dots }

where the denominator of eachfraction 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

Pn1+PnPn.{\displaystyle {\frac {P_{n-1}+P_{n}}{P_{n}}}.}

The approximation

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

of this type was known to Indian mathematicians in the third or fourth century BCE.[3] The Greek mathematicians of the fifth century BCE also knew of this sequence of approximations:[4] Plato refers to the numerators asrational diameters.[5] In the second century CETheon of Smyrna used the term theside and diameter numbers to describe the denominators and numerators of this sequence.[6]

These approximations can be derived from thecontinued fraction expansion of2{\displaystyle {\sqrt {2}}}:

2=1+12+12+12+12+12+.{\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,

577408=1+12+12+12+12+12+12+12.{\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}}}}}}}}}}}}}}.}

AsKnuth (1994) describes, the fact that Pell numbers approximate2 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 theorigin, and form nearly uniformangles around the origin. Alternatively, the points(±(Pi+Pi1),0){\displaystyle (\pm (P_{i}+P_{i-1}),0)},(0,±(Pi+Pi1)){\displaystyle (0,\pm (P_{i}+P_{i-1}))}, and(±Pi,±Pi){\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

[edit]

APell prime is a Pell number that isprime. The first few Pell primes are

2, 5, 29, 5741, 33461, 44560482149, 1746860020068409, 68480406462161287469, ... (sequenceA086383 in theOEIS).

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, ... (sequenceA096650 in theOEIS)

These indices are all themselves prime. As with the Fibonacci numbers, a Pell numberPn can only be prime ifn itself is prime, because ifd is adivisor ofn thenPd is a divisor ofPn.

The only Pell numbers that aresquares,cubes, or any higherpower 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 tosquare triangular numbers.[8] Specifically, these numbers arise from the following identity of Pell numbers:

((Pk1+Pk)Pk)2=(Pk1+Pk)2((Pk1+Pk)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 atriangular 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 toP4n +1 is always a square:

i=04n+1Pi=(r=0n2r(2n+12r))2=(P2n+P2n+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 toP5,0 + 1 + 2 + 5 + 12 + 29 = 49, is the square ofP2 +P3 = 2 + 5 = 7. The numbersP2n +P2n +1 forming the square roots of these sums,

1, 7, 41, 239, 1393, 8119, 47321, … (sequenceA002315 in theOEIS),

are known as theNewman–Shanks–Williams (NSW) numbers.

Pythagorean triples

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

If aright triangle has integer side lengthsa,b,c (necessarily satisfying thePythagorean theorema2 +b2 =c2), then (a,b,c) is known as aPythagorean triple. As Martin (1875) describes, the Pell numbers can be used to form Pythagorean triples in whicha andb are one unit apart, corresponding to right triangles that are nearly isosceles. Each such triple has the form

(2PnPn+1,Pn+12Pn2,Pn+12+Pn2=P2n+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

[edit]

Thecompanion Pell numbers orPell–Lucas numbers are defined by therecurrence relation

Qn={2if n=0;2if n=1;2Qn1+Qn2otherwise.{\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, and82 = 2 × 34 + 14 = 70 + 12. The first few terms of the sequence are (sequenceA002203 in theOEIS):2, 2,6,14,34,82, 198,478, …

Like the relationship betweenFibonacci numbers andLucas numbers,

Qn=P2nPn{\displaystyle Q_{n}={\frac {P_{2n}}{P_{n}}}}

for allnatural numbersn.

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

Qn=(1+2)n+(12)n.{\displaystyle Q_{n}=\left(1+{\sqrt {2}}\right)^{n}+\left(1-{\sqrt {2}}\right)^{n}.}

These numbers are alleven; each such number is twice the numerator in one of the rational approximations to2{\displaystyle {\sqrt {2}}} discussed above.

Like the Lucas sequence, if a Pell–Lucas number1/2Qn is prime, it is necessary thatn be either prime or apower of 2. The Pell–Lucas primes are

3, 7, 17, 41, 239, 577, … (sequenceA086395 in theOEIS).

For thesen are

2, 3, 4, 5, 7, 8, 16, 19, 29, 47, 59, 163, 257, 421, … (sequenceA099088 in theOEIS).

Computations and connections

[edit]

The following table gives the first few powers of thesilver ratioδ =δ S = 1 + 2 and itsconjugateδ = 1 − 2.

n(1 +2)n(1 −2)n
01 + 02 = 11 − 02 = 1
11 + 12 = 2.41421…1 − 12 = −0.41421…
23 + 22 = 5.82842…3 − 22 = 0.17157…
37 + 52 = 14.07106…7 − 52 = −0.07106…
417 + 122 = 33.97056…17 − 122 = 0.02943…
541 + 292 = 82.01219…41 − 292 = −0.01219…
699 + 702 = 197.9949…99 − 702 = 0.0050…
7239 + 1692 = 478.00209…239 − 1692 = −0.00209…
8577 + 4082 = 1153.99913…577 − 4082 = 0.00086…
91393 + 9852 = 2786.00035…1393 − 9852 = −0.00035…
103363 + 23782 = 6725.99985…3363 − 23782 = 0.00014…
118119 + 57412 = 16238.00006…8119 − 57412 = −0.00006…
1219601 + 138602 = 39201.99997…19601 − 138602 = 0.00002…

Thecoefficients are the half-companion Pell numbersHn and the Pell numbersPn which are the (non-negative) solutions toH  2 − 2P  2 = ±1.Asquare triangular number is a number

N=t(t+1)2=s2,{\displaystyle N={\frac {t(t+1)}{2}}=s^{2},}

which is both thet-th triangular number and thes-th square number. Anear-isosceles Pythagorean triple is an integer solution toa 2 +b 2 =c 2 wherea + 1 =b.

The next table shows that splitting theodd numberHn into nearly equal halves gives a square triangular number whenn is even and a near isosceles Pythagorean triple whenn is odd. All solutions arise in this manner.

nHnPntt + 1sabc
010010   
111   011
232121   
375   345
41712896   
54129   202129
69970495035   
7239169   119120169
8577408288289204   
91393985   696697985
1033632378168116821189   
1181195741   405940605741
121960113860980098016930   

Definitions

[edit]

The half-companion Pell numbersHn and the Pell numbersPn can be derived in a number of easily equivalent ways.

Raising to powers

[edit]
(1+2)n=Hn+Pn2{\displaystyle \left(1+{\sqrt {2}}\right)^{n}=H_{n}+P_{n}{\sqrt {2}}}
(12)n=HnPn2.{\displaystyle \left(1-{\sqrt {2}}\right)^{n}=H_{n}-P_{n}{\sqrt {2}}.}

From this it follows that there areclosed forms:

Hn=(1+2)n+(12)n2.{\displaystyle H_{n}={\frac {\left(1+{\sqrt {2}}\right)^{n}+\left(1-{\sqrt {2}}\right)^{n}}{2}}.}

and

Pn2=(1+2)n(12)n2.{\displaystyle P_{n}{\sqrt {2}}={\frac {\left(1+{\sqrt {2}}\right)^{n}-\left(1-{\sqrt {2}}\right)^{n}}{2}}.}

Paired recurrences

[edit]
Hn={1if n=0;Hn1+2Pn1otherwise.{\displaystyle H_{n}={\begin{cases}1&{\mbox{if }}n=0;\\H_{n-1}+2P_{n-1}&{\mbox{otherwise.}}\end{cases}}}
Pn={0if n=0;Hn1+Pn1otherwise.{\displaystyle P_{n}={\begin{cases}0&{\mbox{if }}n=0;\\H_{n-1}+P_{n-1}&{\mbox{otherwise.}}\end{cases}}}

Reciprocal recurrence formulas

[edit]

Letn be at least 2.

Hn=(3PnPn2)/2=3Pn1+Pn2;{\displaystyle H_{n}=(3P_{n}-P_{n-2})/2=3P_{n-1}+P_{n-2};}
Pn=(3HnHn2)/4=(3Hn1+Hn2)/2.{\displaystyle P_{n}=(3H_{n}-H_{n-2})/4=(3H_{n-1}+H_{n-2})/2.}

Matrix formulations

[edit]
(HnPn)=(1211)(Hn1Pn1)=(1211)n(10).{\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

(Hn2PnPnHn)=(1211)n.{\displaystyle {\begin{pmatrix}H_{n}&2P_{n}\\P_{n}&H_{n}\end{pmatrix}}={\begin{pmatrix}1&2\\1&1\end{pmatrix}}^{n}.}

Approximations

[edit]

The difference betweenHn andPn2 is

(12)n(0.41421)n,{\displaystyle \left(1-{\sqrt {2}}\right)^{n}\approx (-0.41421)^{n},}

which goes rapidly to zero. So

(1+2)n=Hn+Pn2{\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 ratiosHn/Pn rapidly approach2; andHn/Hn −1 andPn/Pn −1 rapidly approach 1 + 2.

H  2 − 2P  2 = ±1

[edit]

Since2 is irrational, we cannot haveH/P = 2, i.e.,

H2P2=2P2P2.{\displaystyle {\frac {H^{2}}{P^{2}}}={\frac {2P^{2}}{P^{2}}}.}

The best we can achieve is either

H2P2=2P21P2orH2P2=2P2+1P2.{\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 toH  2 − 2P  2 = 1 are exactly the pairs(Hn,Pn) withn even, and the solutions toH  2 − 2P  2 = −1 are exactly the pairs(Hn,Pn) withn odd. To see this, note first that

Hn+122Pn+12=(Hn+2Pn)22(Hn+Pn)2=(Hn22Pn2),{\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 withH  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

(2PH)22(HP)2=(H22P2).{\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 fromH0 = 1 andP0 = 0.

Square triangular numbers

[edit]
Main article:Square triangular number

The required equation

t(t+1)2=s2{\displaystyle {\frac {t(t+1)}{2}}=s^{2}}

is equivalent to4t2+4t+1=8s2+1,{\displaystyle 4t^{2}+4t+1=8s^{2}+1,}which becomesH  2 = 2P  2 + 1 with the substitutionsH = 2t + 1 andP = 2s. Hence then-th solution is

tn=H2n12andsn=P2n2.{\displaystyle t_{n}={\frac {H_{2n}-1}{2}}\quad {\mbox{and}}\quad s_{n}={\frac {P_{2n}}{2}}.}

Observe thatt andt + 1 are relatively prime, so thatt (t + 1)/2 = s 2 happens exactly when they are adjacent integers, one a squareH  2 and the other twice a square 2P  2. Since we know all solutions of that equation, we also have

tn={2Pn2if n is even;Hn2if 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}}}

andsn=HnPn.{\displaystyle s_{n}=H_{n}P_{n}.}

This alternate expression is seen in the next table.

nHnPntt + 1sabc
010      
111121345
232896202129
375495035119120169
41712288289204696697985
54129168116821189405940605741
69970980098016930236602366133461

Pythagorean triples

[edit]

The equalityc 2 =a 2 + (a + 1) 2 = 2a 2 + 2a + 1 occurs exactly when2c 2 = 4a 2 + 4a + 2 which becomes2P  2 =H  2 + 1 with the substitutionsH = 2a + 1 andP =c. Hence then-th solution isan =H2n +1 − 1/2 andcn =P2n +1.

The table above shows that, in one order or the other,an andbn =an + 1 areHnHn +1 and2PnPn +1 whilecn =Hn +1Pn +Pn +1Hn.

Notes

[edit]
  1. ^For instance, Sellers (2002) proves that the number ofperfect matchings in theCartesian product of apath graph and thegraphK4 − 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 theShulba Sutras; see e.g. Dutka (1986), who cites Thibaut (1875) for this information.
  4. ^See Knorr (1976) for the fifth century date, which matchesProclus' claim that the side and diameter numbers were discovered by thePythagoreans. 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, inPlato's Republic there is a reference to the "rational diameter of 5", by whichPlato means 7, the numerator of the approximation7/5 of which 5 is the denominator.
  6. ^Heath, Sir Thomas Little (1921),History of Greek Mathematics: From Thales to Euclid, Courier Dover Publications, p. 112,ISBN 9780486240732.
  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 thesquare triangular number article for a more detailed derivation.

References

[edit]

External links

[edit]
Prime number classes
By formula
By integer sequence
By property
Base-dependent
Patterns
k-tuples
By size
Complex numbers
Composite numbers
Related topics
First 60 primes
Classes ofnatural numbers
Powers and related numbers
Of the forma × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Otherprime factor ordivisor related numbers
Numeral system-dependent numbers
Arithmetic functions
anddynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via asieve
Sorting related
Graphemics related
Integer sequences
Basic
Advanced(list)
Fibonacci spiral with square sizes up to 34.
Properties of sequences
Properties of series
Series
Convergence
Explicit series
Convergent
Divergent
Kinds of series
Hypergeometric series
Retrieved from "https://en.wikipedia.org/w/index.php?title=Pell_number&oldid=1256792511#Primes_and_squares"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp