Erdős problem 1113

Erdős Problem 1113. Do there exist Sierpiński numbers that possess no finite covering set of primes?

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1113.lean

Retained formal statement3 of 3

Sierpiński [Si60] proved that there are infinitely many Sierpiński numbers, using covering systems to construct suitable covering sets for any $k$ satisfying a certain congruence.

FormalConjectures/ErdosProblems/1113.leanErdos1113.erdos_1113.variants.infinitely_many_sierpinski1 lineExact file

1{k | k.IsSierpinskiNumber}.Infinite

SolvedStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures3
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/
  - 1113.lean3