Perrin number: Difference between revisions
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 ...) |
mNo edit summary |
||
(4 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
The Perrin numbers are | {{subpages}} | ||
The '''Perrin numbers''' are defined by the recurrence relation | |||
:<math> | :<math> | ||
Line 15: | Line 16: | ||
== Properties == | == Properties == | ||
A special property of the sequence of Perrin numbers is, that if <math>p\ </math> is a | A special property of the sequence of Perrin numbers is, that if <math>p\ </math> is a [[prime number]], then <math>p\ </math> divides <math>P_p\ </math>. The converse is false, because there exist composite numbers <math>q\ </math> which divide <math>P_q\ </math>. Those numbers <math>q\ </math> are called Perrin pseudoprimes. | ||
The first few Perrin pseudoprimes are: 271441, 904631, 16532714, 24658561, 27422714, ... | The first few Perrin pseudoprimes are: 271441, 904631, 16532714, 24658561, 27422714, ...[[Category:Suggestion Bot Tag]] |
Latest revision as of 16:01, 2 October 2024
The Perrin numbers are 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, then divides . The converse is false, because there exist composite numbers which divide . Those numbers are called Perrin pseudoprimes. The first few Perrin pseudoprimes are: 271441, 904631, 16532714, 24658561, 27422714, ...