Poulet number

From Number
Revision as of 23:04, 21 March 2009 by Vipul (talk | contribs) (Created page with '{{pseudoprimality property}} ==Definition== A '''Poulet number''' is an odd composite number <math>n</math> such that: <math>2^{n-1} \equiv 1 \mod n</math>. In other words, <...')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Template:Pseudoprimality property

Definition

A Poulet number is an odd composite number such that:

.

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

Relation with other properties

Stronger properties