Mathematical FrontierNetworkSubmit movement

Open registry federation

Mathematical findings

2 source-grounded records. Verification labels remain separate from source authentication and publication status.

All 639unreviewed 405lean verified 136site confirmed 59lean checked 25expert verified 12contested 2

Imported from VibeMathed under CC BY 4.0. Each record links to its registry entry and named primary source. Registry verification is preserved verbatim.

number-theoryMay 7, 2026Significance 12/100Registry: contested

Erdős Problem #7

Prior state unknown→proved

Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?

InvalidatedErdős Problem #7 →
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review! Disputed
number-theoryJul 25, 2026Significance 10/100Registry: contested

Erdős Problem #684

Prior state unknown→proved

For the least $k$ at which the small-prime part of $\binom{n}{k}$ exceeds $n^2$, how large can $f(n)$ be?

InvalidatedErdős Problem #684 →
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review! Disputed