← All problems

Erdős Problem #1059 — Primes with composite factorial differences

21 years old · documented by

Are there infinitely many prime numbers pp such that, for every positive integer kk whose factorial is less than pp, the difference p−k!p-k! is composite?

∀k∈Z≥1,k!<p ⟹ p−k! is composite.\forall k\in\mathbb Z_{\ge 1},\qquad k!<p\ \Longrightarrow\ p-k!\text{ is composite}.

Here k!=1⋅2⋯kk!=1\cdot2\cdots k, and “composite” means an integer greater than 11 that is not prime. The strict inequality ensures that p−k!p-k! is positive; it does not by itself ensure that the difference is composite. Erdős Problems #1059

Background

The question is attributed to Erdős and is reported as problem A2 in Richard K. Guy’s Unsolved Problems in Number Theory. Its condition is simultaneous over all factorials below a given prime: the prime must avoid being prime after subtraction of each such factorial. Erdős Problems #1059 Guy (2004), Unsolved Problems in Number Theory

Erdős suggested a related existence direction: find infinitely many integers nn such that, for the integer ll with l!<n≤(l+1)!l!<n\le (l+1)!, every prime factor of nn exceeds ll, and n−k!n-k! is composite for every integer kk with 1≤k≤l1\le k\le l. This is presented as a potentially easier related problem, not as an equivalent reformulation of the prime question. Erdős Problems #1059

References

Progress summary

Refreshed
Open
Sources

Solutions 0

No solutions have been posted yet.