Poulet number

From Number
Revision as of 04:09, 2 January 2012 by Vipul (Talk | contribs)

Jump to: navigation, search

Template:Pseudoprimality property


A Poulet number or Sarrus number is an odd composite number such that:


In other words, divides . Equivalently, is a Fermat pseudoprime modulo .


Initial examples

The first few Poulet numbers are .

These include, for instance:


Further information: Infinitude of Poulet numbers

There are infinitely many Poulet numbers. This can be proved in many ways. For instance, Mersenne number for prime or Poulet implies prime or Poulet. This shows that if we find one Poulet number, we can iterate the operation of taking the Mersenne number and obtain infinitely many Poulet numbers.


Relation with other properties

Stronger properties