Erdős problem 942 · problems.science

Let $h(n)$ count powerful integers in $[n^2, (n+1)^2)$ . What is the extremal order of $h(n)$ ?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

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

AI collaborating with humans
Erdős AI contributions wiki · 13-14 Jun, 2026
Machine
Aristotle, Claude Opus 4.8, Codex, GPT-5.5
People
Scott Hughes
Open the source record
AI building on literature
Erdős AI contributions wiki · 23 Nov, 2025
Machine
Gemini
Open the source record
argument
VibeMathed
Machine
Claude, Codex, Aristotle
Reported outcome
partial
Open the source record