Erdős problem 936

Is $2^n + 1$ powerful for finitely many $n$ ?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

936.lean

Retained formal statement3 of 4

Is $2^n + 1$ powerful for finitely many $n$ ?

FormalConjectures/ErdosProblems/936.leanErdos936.erdos_936.variants.two_pow_add_one1 lineExact file

1True ↔ Erdos936.EventuallyNotPowerful fun x => 2 ^ x + 1

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures4
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/
  - 936.lean4