## You are here

HomePillai prime

## Primary tabs

# Pillai prime

If for a given prime $p$ we can find an integer $n>0$ such that $n!\equiv-1\mod p$ but $p\not\equiv 1\mod n$ then $p$ is a called a Pillai prime. These are listed in A063980 of Sloane’s OEIS. Sarinya Intaraprasert proved that there are infinitely many Pillai primes. The first few are 23, 29, 59, 61, 67, 71, 79, 83, 109, 137, 139, 149, 193, …

# References

- 1 R. K. Guy, Unsolved Problems in Number Theory New York: Springer-Verlag 2004: A2

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

11A41*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella