KNOWPIA
WELCOME TO KNOWPIA

In mathematics, the **Perrin numbers** are defined by the recurrence relation

*P*(*n*) =*P*(*n*− 2) +*P*(*n*− 3) for*n*> 2,

with initial values

*P*(0) = 3,*P*(1) = 0,*P*(2) = 2.

The sequence of Perrin numbers starts with

The number of different maximal independent sets in an *n*-vertex cycle graph is counted by the *n*th Perrin number for *n* > 1.^{[1]}^{[page needed]}

This sequence was mentioned implicitly by Édouard Lucas (1876). In 1899, the same sequence was mentioned explicitly by François Olivier Raoul Perrin.^{[2]}^{[page needed]} The most extensive treatment of this sequence was given by Adams and Shanks (1982).

The generating function of the Perrin sequence is

The Perrin sequence numbers can be written in terms of powers of the roots of the equation

This equation has 3 roots; one real root *p* (known as the plastic number) and two complex conjugate roots *q* and *r*. Given these three roots, the Perrin sequence analogue of the Lucas sequence Binet formula is

Since the magnitudes of the complex roots *q* and *r* are both less than 1, the powers of these roots approach 0 for large *n*. For large *n* the formula reduces to

This formula can be used to quickly calculate values of the Perrin sequence for large n. The ratio of successive terms in the Perrin sequence approaches *p*, a.k.a. the plastic number, which has a value of approximately 1.324718. This constant bears the same relationship to the Perrin sequence as the golden ratio does to the Lucas sequence. Similar connections exist also between *p* and the Padovan sequence, between the golden ratio and Fibonacci numbers, and between the silver ratio and Pell numbers.

From the Binet formula, we can obtain a formula for *G*(*kn*) in terms of *G*(*n*−1), *G*(*n*) and *G*(*n*+1); we know

which gives us three linear equations with coefficients over the splitting field of ; by inverting a matrix we can solve for and then we can raise them to the *k*th power and compute the sum.

Example magma code:

P<x> := PolynomialRing(Rationals()); S<t> := SplittingField(x^3-x-1); P2<y> := PolynomialRing(S); p,q,r := Explode([r[1] : r in Roots(y^3-y-1)]); Mi:=Matrix([[1/p,1/q,1/r],[1,1,1],[p,q,r]])^(-1); T<u,v,w> := PolynomialRing(S,3); v1 := ChangeRing(Mi,T) *Matrix([[u],[v],[w]]); [p^i*v1[1,1]^3 + q^i*v1[2,1]^3 + r^i*v1[3,1]^3 : i in [-1..1]];

with the result that, if we have , then

The number 23 here arises from the discriminant of the defining polynomial of the sequence.

This allows computation of the nth Perrin number using integer arithmetic in multiplies.

It has been proven that for all primes *p*, *p* divides *P*(*p*). However, the converse is not true: for some composite numbers *n*, *n* may still divide *P*(*n*). If *n* has this property, it is called a "Perrin pseudoprime".

The first few Perrin pseudoprimes are

- 271441, 904631, 16532714, 24658561, 27422714, 27664033, 46672291, 102690901, 130944133, 196075949, 214038533, 517697641, 545670533, 801123451, 855073301, 903136901, 970355431, ... (sequence A013998 in the OEIS)

The question of the existence of Perrin pseudoprimes was considered by Perrin himself, but it was not known whether they existed until Adams and Shanks (1982) discovered the smallest one, 271441 = 521^{2}; the next-smallest is 904631 = 7 x 13 x 9941. There are seventeen of them less than a billion;^{[3]} Jon Grantham has proved^{[4]} that there are infinitely many Perrin pseudoprimes.

Adams and Shanks (1982) noted that primes also meet the condition that *P*(*-p*) = *-1* mod *p*. Composites where both properties hold are called "restricted Perrin pseudoprimes" (sequence A018187 in the OEIS). Further conditions can be applied using the six element signature of *n* which must be one of three forms (e.g. OEIS: A275612 and OEIS: A275613).

While Perrin pseudoprimes are rare, they have significant overlap with Fermat pseudoprimes. This contrasts with the Lucas pseudoprimes which are anti-correlated. The latter condition is exploited to yield the popular, efficient, and more effective BPSW test which has no known pseudoprimes, and the smallest is known to be greater than 2^{64}.

A **Perrin prime** is a Perrin number that is prime. The first few Perrin primes are:

- 2, 3, 5, 7, 17, 29, 277, 367, 853, 14197, 43721, 1442968193, 792606555396977, 187278659180417234321, 66241160488780141071579864797, ... (sequence A074788 in the OEIS)

For these Perrin primes, the index *n* of *P*(*n*) is

- 2, 3, 4, 5, 6, 7, 10, 12, 20, 21, 24, 34, 38, 75, 122, 166, 236, 355, 356, 930, 1041+1, 1214, 1461, 1622, 4430, 5802, 9092, ... (sequence A112881 in the OEIS)

Generating P(n) where n is a negative integer yields a similar property regarding primality: if n is a negative, then P(n) is prime when P(n) mod -n = -n - 1. The following sequence represents P(n) for all n that are negative integers:

**^**Füredi (1987)**^**Knuth (2011)**^**(sequence A013998 in the OEIS)**^**Grantham, Jon (2010). "There are infinitely many Perrin pseudoprimes" (PDF).*Journal of Number Theory*.**130**(5): 1117–1128. arXiv:1903.06825. doi:10.1016/j.jnt.2009.11.008.

- Füredi, Z. (1987). "The number of maximal independent sets in connected graphs".
*Journal of Graph Theory*.**11**(4): 463–470. doi:10.1002/jgt.3190110403.

- Knuth, Donald E. (2011).
*The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1*. Addison-Wesley. ISBN 0201038048.

- Adams, William; Shanks, Daniel (1982). "Strong primality tests that are not sufficient".
*Mathematics of Computation*. American Mathematical Society.**39**(159): 255–300. doi:10.2307/2007637. JSTOR 2007637. MR 0658231.

- Perrin, R. (1899). "Query 1484".
*L'Intermédiaire des Mathématiciens*.**6**: 76.

- Zentrum für Hirnforschung Institut für Medizinische Kybernetik und Artificial Intelligence
- "Lucas Pseudoprimes".
*MathPages.com*. - "Perrin's Sequence".
*MathPages.com*. - OEIS sequence A225876 (Composite n which divide s(n)+1, where s is ...)—Perrin-like sequence
- Perrin Primality Tests