Skip to content

Erdős problem 412

Let σ1(n)=σ(n)σ_1(n)=σ(n), the sum of divisors function, and σk(n)=σ(σk−1(n))σ_k(n) = σ(σ_{k-1}(n)). Is it true that, for every m,n≥2m, n ≥ 2, there exist some i,ji, j such that σi(m)=σj(n)σ_i(m) = σ_j(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

No source records work against this Problem.