Fermat pseudoprime: Difference between revisions

From Number
(Created page with '{{base-relative pseudoprimality property}} ==Definition== Suppose <math>n</math> is a composite natural number and <math>a</math> is relatively prime to <math>n</math>. <math>n...')
 
No edit summary
Line 1: Line 1:
{{base-relative pseudoprimality property}}
{{base-relative pseudoprimality property}}
 
{{nottobeconfusedwith|Fermat prime}}
==Definition==
==Definition==



Revision as of 22:26, 19 April 2009

Template:Base-relative pseudoprimality property This is not to be confused with Fermat prime

Definition

Suppose n is a composite natural number and a is relatively prime to n. n is termed a Fermat pseudoprime relative to base a if we have:

an11modn.

In other words, n divides an11, or, the order of a mod n divides n1.

Relation with other properties

Stronger properties

Property when applied to one or more choice of base

  • Absolute pseudoprime is a number that is a Fermat pseudoprime for every (relatively prime) base.
  • Poulet number is a Fermat pseudoprime to base 2 (in particular, it needs to be an odd number).