Erdős problem 830
We say that are an amicable pair if . If counts the number of amicable then one can show that .
Sources
FormalConjectures/ErdosProblems/
830.lean
Retained formal statement
We say that are an amicable pair if . If counts the number of amicable then one can show that .
∃ o, o =o[Filter.atTop] 1 ∧ ∀ᶠ (x : ℝ) in Filter.atTop, Erdos830.A x ≤ x * Real.exp (-(1 / 2 + o x) * √(Real.log x * Real.log (Real.log x)))SolvedStatement only, no proof