Erdős problem 943
Let be the set of powerful numbers. Is is true that for every ?
Sources
FormalConjectures/ErdosProblems/
943.lean
Retained formal statement
Let be the set of powerful numbers. Is is true that for every ?
True ↔ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ᶠ (n : ℕ) in Filter.atTop, ↑(AdditiveCombinatorics.sumRep Nat.Powerful n) ≤ ↑n ^ o nOpenStatement only, no proof