Skip to content

Erdős problem 1054

Let f(n)f(n) be the minimal integer mm such that nn is the sum of the kk smallest divisors of mm for some k≥1k\geq 1. Show that ff is undefined at n=2n=2, i.e. we get the junk value 00.

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 standalone

    Erdős AI contributions wiki · 22-23 Jun, 2026

    Machine
    Claude Opus 4.8, GPT-5.5 Pro, Principia Math
    Open the source record