Erdős problem 884
For a natural number n, let denote the divisors of n in increasing order. Does it hold that for , i.e. Unparsed notation: \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}) Unparsed notation: \right)?
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:15b8c9230e575a58e7aa446a12ebf13f46d97c1f2e92c43386136f514562fca2
- Metadata
- sha256:3cd72c0741ad2aec8004f50e410963247eaa7e2f53433526a454c508acf06e97
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:f21a2b31382f818f5f9729b36526502e37dcc1107db1c83a0c5d23f2e88eec13
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb