Erdős Problem #1142 — Prime Differences from Powers of Two
For a natural number , require and require every positive integer exponent for which to give a prime difference. In symbols, set
Is infinite? Erdős Problems #1142
Background
This condition asks for a long, highly structured collection of prime differences: for each admissible , the numbers are required to be prime up to the largest power of two below . The number of tested powers grows on the order of . The known examples are . Erdős conjectured that is the largest example; later computations were reported through without finding another, while Mientka and Weitzenkamp are specifically credited with excluding further examples through . Erdős Problems #1142 Elsholtz (2004)
The problem is also a special case of counting prime patterns whose number of terms grows with the size of the range. Vaughan’s large-sieve estimate for this powers-of-two pattern gives an upper bound on how many integers can satisfy all the simultaneous primality conditions; it controls their frequency, rather than directly deciding whether there are infinitely many. Elsholtz (2004) Erdős Problems #1142
Progress summary
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.