Definition:Poulet Number

Theorem
That is, let $q$ be a composite number such that $2^q \equiv 2 \pmod q$.

Then $q$ is a Poulet number.

Also known as
Poulet numbers are also referred to as pseudoprimes or Fermat pseudoprimes to base $2$.