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)?
Erdős Problems records this as disproved (Lean).
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal2 retained
- Resolutiondisproved (Lean)
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it575 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.