← All problems

Erdős Problem #1142 — Prime Differences from Powers of Two

1 year old · traced to

For a natural number nn, require n>2n>2 and require every positive integer exponent kk for which 2k<n2^k<n to give a prime difference. In symbols, set

E={n∈N:n>2 and ∀k∈N, (k>0 and 2k<n)⟹n−2k is prime}.\mathcal{E}=\left\{n\in\mathbb{N}: n>2\ \text{and}\ \forall k\in\mathbb{N},\ (k>0\ \text{and}\ 2^k<n)\Longrightarrow n-2^k\ \text{is prime}\right\}.

Is E\mathcal{E} infinite? Erdős Problems #1142

Background

This condition asks for a long, highly structured collection of prime differences: for each admissible nn, the numbers n−2,n−4,n−8,…n-2,n-4,n-8,\ldots are required to be prime up to the largest power of two below nn. The number of tested powers grows on the order of log⁡n\log n. The known examples are 4,7,15,21,45,75,1054,7,15,21,45,75,105. Erdős conjectured that 105105 is the largest example; later computations were reported through 2772^{77} without finding another, while Mientka and Weitzenkamp are specifically credited with excluding further examples through 2442^{44}. 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

References

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.