Definition:Carmichael Number

Definition
An odd integer $n > 0$ is a Carmichael number iff:
 * $(1): \quad n$ is composite
 * $(2): \quad \forall a \in \Z: a \perp n: a^n \equiv a \pmod n$, or, equivalently, that $a^{n-1} \equiv 1 \pmod n$.

That is, a Carmichael number is a composite number which satisfies $a^n \equiv a \pmod n$ for all integers coprime to it.

The sequence of Carmichael numbers starts:
 * $561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, \ldots$

Also known as
A Carmichael number is also referred to as a pseudoprime (or Fermat liar), as it exhibits the same properties as a prime when Fermat's Little Theorem is applied.

Properties
The characterization of Carmichael Numbers was given by A. Korselt in what is known as Korselt's Theorem, which states the following:

An odd integer $n>0$ is a Carmichael number iff both of the following conditions hold for each prime factor of $n$:


 * $(1): \quad p^2 \nmid n$
 * $(2): \quad \left({p - 1}\right) \mathop \backslash \left({n - 1}\right)$

He found the first Carmichael number ($561$) in 1912.