Perrin number: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Olier Raby
(→‎Properties: Grammar.)
mNo edit summary
 
(One intermediate revision by one other user not shown)
Line 16: Line 16:
== Properties ==
== Properties ==


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.
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

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 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, ...