Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 412

../


Statement. Let σ1(n)=σ(n)\sigma_1(n)=\sigma(n), the sum of divisors function, and σk(n)=σ(σk−1(n))\sigma_k(n)=\sigma(\sigma_{k-1}(n)).

Is it true that, for every m,n≥2m,n\geq 2, there exist some i,ji,j such that σi(m)=σj(n)\sigma_i(m)=\sigma_j(n)?

Status. Open.

Source. erdosproblems.com/412, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #412, https://www.erdosproblems.com/412.

References.

  • [Er79d] Erdős, P., Some unconventional problems in number theory. Acta Math. Acad. Sci. Hungar. (1979), 71-80.

Formalization. Statement in formal-conjectures.

Current assessment

ErGr80's attribution, numerical-evidence report and historical outlook on printed p. 81 supply no certified disjoint pair or proof/disproof. The imported Open status is retained, and the linked formal declaration is recorded at statement scope. This page does not date or scope a current literature search or record reviewed proof coverage for the displayed question.

Known Results

Historical formulation and evidence

Erdős and Graham's 1980 monograph, printed p. 81, attributes the iterated-σ\sigma question to van Wijngaarden in the 1950s. Its literal formulation asks whether, for every m,nm,n, some iterates satisfy σi(m)=σj(n)\sigma_i(m)=\sigma_j(n). It does not state the displayed question's restriction m,n≥2m,n\geq2; that question is a strict specialization of the source wording.

The authors report Selfridge's numerical evidence suggesting a negative answer and express doubt that a proof would be available in the near future. This describes the historical evidence and outlook, not a certified counterexample or a current-status argument. Er79d remains the distinct 1979 source already cited above.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.