Pillai prime

In number theory, a Pillai prime is a prime number p for which there is an integer n > 0 such that the factorial of n is one less than a multiple of the prime, but the prime is not one more than a multiple of n. To put it algebraically, $n!\equiv -1\mod p$ but $p\not \equiv 1\mod n$. The first few Pillai primes are

23, 29, 59, 61, 67, 71, 79, 83, 109, 137, 139, 149, 193, ... (sequence A063980 in the OEIS)

Pillai primes are named after the mathematician Subbayya Sivasankaranarayana Pillai, who asked about these numbers. Their infinitude has been proved several times, by Subbarao, Erdős, and Hardy & Subbarao.

References

• Guy, R. K. (2004), Unsolved Problems in Number Theory (3rd ed.), New York: Springer-Verlag, p. A2, ISBN 0-387-20860-7.
• Hardy, G. E.; Subbarao, M. V. (2002), "A modified problem of Pillai and some related questions", American Mathematical Monthly, 109 (6): 554–559, doi:10.2307/2695445 {{citation}}: Unknown parameter |lastauthoramp= ignored (|name-list-style= suggested) (help).
• "Pillai prime". PlanetMath.