Erdős problem 1063

Estimate $n_k$ by finding a better upper bound.

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1063.lean

Retained formal statement1 of 6

Estimate $n_k$ by finding a better upper bound.

FormalConjectures/ErdosProblems/1063.leanErdos1063.erdos_1063.better_upper3 linesExact file

1have upper_bound := sorry;2(fun k => ↑(Erdos1063.n k)) =O[Filter.atTop] upper_bound ∧3  upper_bound =o[Filter.atTop] fun k => ↑k * (Finset.Icc 1 (k - 1)).lcm fun n => ↑n

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures6
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ős1
no statement retained

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 1063.lean6