Erdős problem 160 · problems.science

On [Mathoverflow](https://mathoverflow.net/a/410815) user [leechlattice](https://mathoverflow.net/users/125498/leechlattice) shows that $h(n) \ll n^{\frac 2 3}$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

160.lean

Retained formal statement2 of 4

Estimate $h(n)$ by finding a better upper bound.

FormalConjectures/ErdosProblems/160.leanErdos160.erdos_160.better_upper2 linesExact file

1have upper_bound := sorry;2(fun n => ↑(Erdos160.erdos_160.h n)) =O[Filter.atTop] upper_bound ∧ upper_bound =o[Filter.atTop] fun n => ↑n ^ (2 / 3)

OpenStatement only, no proof

Sources

Search problems.science