Poulet number

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 Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 2^{n-1}-1} . Equivalently, $n$ is a Fermat pseudoprime modulo $2$.

Occurrence

Initial examples

The first few Poulet numbers are Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 341,561,645,1105,1387,1729,1905,2047} .

These include, for instance:

• The Mersenne number Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 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 Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 561, 1105, 1729} . Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 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.

Facts

• Mersenne number for prime or Poulet implies prime or Poulet
• Infinitude of Poulet numbers

Relation with other properties

Stronger properties

• Absolute pseudoprime (at least, for odd numbers).