In mathematics, specifically in number theory, a Cunningham number is a certain kind of integer named after English mathematician A. J. C. Cunningham.

Cunningham numbers are a simple type of binomial number – they are of the form

${\displaystyle b^{n}\pm 1}$

where b and n are integers and b is not a perfect power. They are denoted C^±(b, n).

The first fifteen terms in the sequence of Cunningham numbers are:

3, 5, 7, 8, 9, 10, 15, 17, 24, 26, 28, 31, 33, 35, 37, ... (sequence A080262 in the OEIS)

• There are infinitely many even and odd Cunningham numbers. Provable through observation that the infinite series

${\displaystyle 6^{n}\pm 1}$

${\displaystyle 5^{n}\pm 1}$

are both contained within the Cunningham numbers, and contain only Odd and Even numbers respectively.

• • By the same logic, there are Infinitely many Cunningham numbers which are 7 modulo 10, and same for 6 modulo 10.

Establishing whether or not a given Cunningham number is prime has been the main focus of research around this type of number.^[1] Two particularly famous families of Cunningham numbers in this respect are the Fermat numbers, which are those of the form C⁺(2, 2^m), and the Mersenne numbers, which are of the form C⁻(2, n).

Cunningham worked on gathering together all known data on which of these numbers were prime. In 1925 he published tables which summarised his findings with H. J. Woodall, and much computation has been done in the intervening time to fill these tables.^[2]

• Cunningham project

• Cunningham Number at MathWorld
• The Cunningham Project, a collaborative effort to factor Cunningham numbers