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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:ac8a10cfa2ef2f7cf47f970fe2e736ac993f545ae144a0ab5d6d5fb3b711ca73
Metadata
sha256:fddf08609df2e20c377d5fcbd9de743f387a78ad3d7b7af4150adbbb4a3fea57
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:08f7bd7f7efe59888086ebbe0d2771e7d97fbbcbb42480246647c88305e2de4e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb