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 statement1 of 4

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

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

1have lower_bound := sorry;2(lower_bound =O[Filter.atTop] fun n => ↑(Erdos160.erdos_160.h n)) ∧3  ∀ c > 0,4    ((fun n => Real.exp (c * Real.log ↑n ^ (1 / 12))) =O[Filter.atTop] fun n => ↑(Erdos160.erdos_160.h n)) →5      ∀ c > 0, (fun n => Real.exp (c * Real.log ↑n ^ (1 / 12))) =o[Filter.atTop] lower_bound

OpenStatement only, no proof

Sources

Search problems.science