Dual View Random Solved Random Open
PROVED This has been solved in the affirmative.
Let $p$ be an odd prime. Is it true that the equation\[(p-1)!+a^{p-1}=p^k\]has only finitely many solutions?
Erdős and Graham remark that it is probably true that in general $(p-1)!+a^{p-1}$ is rarely a power at all (although this can happen, for example $6!+2^6=28^2$).

Erdős and Graham ask this allowing the case $p=2$, but this is presumably an oversight, since clearly there are infinitely many solutions to this equation when $p=2$.

Brindza and Erdős [BrEr91] proved that there are finitely many such solutions. Yu and Liu [YuLi96] showed that the only solutions are\[2!+1^2=3\]\[2!+5^2=3^3\]and\[4!+1^4=5^2.\]

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Bhavik Mehta and Euro Sampaio

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #405, https://www.erdosproblems.com/405, accessed 2026-01-16