Erdős Problem #1059 — Primes with composite factorial differences
Are there infinitely many prime numbers such that, for every positive integer whose factorial is less than , the difference is composite?
Here , and “composite” means an integer greater than that is not prime. The strict inequality ensures that 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 such that, for the integer with , every prime factor of exceeds , and is composite for every integer with . This is presented as a potentially easier related problem, not as an equivalent reformulation of the prime question. Erdős Problems #1059
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Sources
Solutions 0
No solutions have been posted yet.