Erdős problem 943 · problems.science

Let $A$ be the set of powerful numbers. Is is true that $1_A\ast 1_A(n)=n^{o(1)}$ for every $n$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/943.lean

Formal Conjectures

FormalConjectures/ErdosProblems/943.leanErdos943.erdos_9431 lineExact file

1True ↔ ∃ o, o =o[Filter.atTop] 1 ∧ ∀ᶠ (n : ℕ) in Filter.atTop, ↑(AdditiveCombinatorics.sumRep Nat.Powerful n) ≤ ↑n ^ o n

OpenStatement only, no proof

Work these sources record against this Problem. Source-reported attribution, not reviewed here.