Skip to content

Erdős problem 412

Let σ1(n)=σ(n)σ_1(n)=σ(n), the sum of divisors function, and σk(n)=σ(σk1(n))σ_k(n) = σ(σ_{k-1}(n)). Is it true that, for every m,n2m, n ≥ 2, there exist some i,ji, j such that σi(m)=σj(n)σ_i(m) = σ_j(n)?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:08f7bd7f7efe59888086ebbe0d2771e7d97fbbcbb42480246647c88305e2de4e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page