← All problems

Erdős Problem #405 — Prime-power values of a factorial plus a power

46 years old · traced to

The source states the question for an odd prime pp: does the equation

(p−1)!+ap−1=pk(p-1)!+a^{p-1}=p^k

have only finitely many solutions? The statement does not specify the domains of aa and kk. Erdős Problem #405

Background

Erdős and Graham posed the problem in their 1980 collection of problems in combinatorial number theory. They remarked that (p−1)!+ap−1(p-1)!+a^{p-1} should rarely be a power at all, illustrating the broader observation with 6!+26=2826!+2^6=28^2. That example concerns being a power, not the more restrictive requirement that the value be a power of the same prime pp. Erdős Problem #405

The odd-prime restriction matters. The problem record notes that allowing p=2p=2 would give infinitely many solutions: for each positive integer kk, 1!+(2k−1)=2k1!+(2^k-1)=2^k. Thus the finiteness question is understood with pp odd, rather than over all primes. Erdős Problem #405

References

P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).

Source: P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.