Perrin number: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Karsten Meyer
(New page: The Perrin numbers are a defined bythe recurrence relation :<math> P_n := \begin{cases} 3 & \mbox{if } n = 0; \\ 0 & \mbox{if } n = 1; \\ 2 ...)
 
imported>David E. Volk
(subpages)
Line 1: Line 1:
The Perrin numbers are a defined bythe recurrence relation
{{subpages}}
The '''Perrin numbers''' are a defined by the recurrence relation


:<math>  
:<math>  

Revision as of 10:04, 1 January 2008

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

The Perrin numbers are a defined by the recurrence relation

The first few numbers of the sequence are: 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, ...

Properties

A special property of the sequence of Perrin numbers is, that if is a Prime number,than divides . The converse is false, because there exist composite numbers which divides . Those numbers are called Perrin pseudoprimes. The first few Perrin pseudoprimes are: 271441, 904631, 16532714, 24658561, 27422714, ...