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$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:a6ca76905a93e2404a98a38d872df6db5dafb07c41a22b50d00184fcde56db14
Metadata: sha256:a35fd5f2a73722542530e3ff35d4a6fc519c60c585e9057832c0a2573ba08628
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:ecb217588d4ce4174342d06ba9c52b00e4da6f027583d05523eca3be7837da4c

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207