Erdős Problem #709
Prior state unknown→proved
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theory / Extremal Divisibility
Erdős Problem #709
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open
upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open
Recorded attempts
Evidence graph
Connected research record
- →
- →Erdős Problem #709
parent of · event · claim reported