Skip to content

Erdős problem 884

For a natural number n, let 1=d1<<dτ(n)=n1 = d_1 < \dotsc < d_{\tau(n)} = n denote the divisors of n in increasing order. Does it hold that 1i<jτ(n)1djdi1+1i<τ(n)1di+1di\sum_{1 \le i < j \le \tau(n)} \frac{1}{d_j - d_i} \ll 1 + \sum_{1 \le i < \tau(n)} \frac{1}{d_{i + 1} - d_i} for nn \to \infty`, i.e. \sum_{1 \le i < j \le \tau(n)} \frac{1}{d_j - d_i} \in O \left( 1 + \sum_{1 \le i < \tau(n)} \frac{1}{d_{i + 1} - d_i}) \right)?

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:15b8c9230e575a58e7aa446a12ebf13f46d97c1f2e92c43386136f514562fca2
Metadata
sha256:3cd72c0741ad2aec8004f50e410963247eaa7e2f53433526a454c508acf06e97
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:f21a2b31382f818f5f9729b36526502e37dcc1107db1c83a0c5d23f2e88eec13
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page