Skip to content

Erdős problem 942

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

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. 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