Poulet number: Difference between revisions

Revision as of 00:35, 22 April 2009

Template:Pseudoprimality property

Definition

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

$2^{n-1}\equiv 1\mod n$ .

In other words, $n$ divides $2^{n-1}-1$ . Equivalently, $n$ is a Fermat pseudoprime modulo $2$ .

Occurrence

Initial examples

The first few Poulet numbers are $341,561,645,1105,1387,1729,1905,2047$ .

These include, for instance:

The Mersenne number $M_{11}=2047$ , which is a Poulet number on account of the fact that Mersenne number for prime or Poulet implies prime or Poulet.
Three Carmichael numbers -- these are numbers that are pseudoprime to every relatively prime base. These are $561,1105,1729$ . $1729$ is also known as the Hardy-Ramanujan number, and is the smallest number expressible as the sum of two cubes in two distinct ways.

Infinitude

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

Absolute pseudoprime (at least, for odd numbers).

@@ Line 8: / Line 8: @@
 In other words, <math>n</math> divides <math>2^{n-1} - 1</math>. Equivalently, <math>n</math> is a [[defining ingredient::Fermat pseudoprime]] modulo <math>2</math>.
+==Occurrence==
+===Initial examples===
+The first few Poulet numbers are <math>341, 561, 645, 1105, 1387, 1729, 1905, 2047</math>.
+These include, for instance:
+* The [[Mersenne number]] <math>M_{11} = 2047</math>, which is a Poulet number on account of the fact that [[Mersenne number for prime or Poulet implies prime or Poulet]].
+* Three [[Carmichael number]]s -- these are numbers that are pseudoprime to every relatively prime base. These are <math>561, 1105, 1729</math>. <math>1729</math> is also known as the [[Hardy-Ramanujan number]], and is the smallest number expressible as the sum of two cubes in two distinct ways.
+===Infinitude===
+{{further|[[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==
@@ Line 13: / Line 30: @@
 ===Stronger properties===
-* [[Weaker than::Absolute pseudoprime]] (at least, in the odd number case).
+* [[Weaker than::Absolute pseudoprime]] (at least, for odd numbers).