Erdős problem 1142

Are there infinitely many $n > 2$ such that $n - 2^k$ is prime for all $k \geq 1$ with $2^k < n$ ?

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1142.lean

Retained formal statement1 of 10

Are there infinitely many $n > 2$ such that $n - 2^k$ is prime for all $k \geq 1$ with $2^k < n$ ?

The only known such $n$ are $4, 7, 15, 21, 45, 75, 105$ (OEIS A039669).

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_11421 lineExact file

1sorry ↔ Infinite ↑{n | Erdos1142.Erdos1142Prop n}

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures10
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs0
not observed here
Erdős AI contributions wiki0
not observed here
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 1142.lean10