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

About 1 year old · traced to

For n∈Nn\in\mathbb N, let P(n)P(n) mean

2<nand∀k∈N,  0<k ∧ 2k<n ⟹ n−2k is prime.2<n\quad\text{and}\quad \forall k\in\mathbb N,\; 0<k\ \land\ 2^k<n\ \Longrightarrow\ n-2^k\text{ is prime}.

Is the set of natural numbers nn satisfying P(n)P(n) infinite?

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.