Pseudoprime

From Citizendium
Revision as of 18:49, 28 January 2008 by imported>Todd Coles (subpages)
Jump to navigation Jump to search
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.

A Pseudoprime is a composite number, which have with Prime numbers common properties.

Introduce

If you would find out if a number is a prime number, you have properties to test it. A property of prime numbers, that they are only divisible by one and itself. Some of the properties are not only true to prime numbers. So you can say, that every prime number has the form: or . Not only prime numbers has these form, but also the composite numbers 25, 35, 49, 55, 65, 77, 85, 91, ... . So, in relation of the property or , you could say, that 25, 35, 49, 55, 65, 77, 85, 91, ... are pseudoprimes. There exist better properties, wich leads to special pseudoprimes:

Different kinds of Pseudoprimes

Property kind of Pseudoprime
Fermat pseudoprime
Euler pseudoprime
strong pseudoprime
is divisible by Carmichael number
is divisible by Perrin pseudoprime
is divisible by