For every r≥5, M(r)=N_r(r−1).
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every r≥5, M(r)=N_r(r−1). Open residue: General r≥5; companion to the prefix conjecture.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
The source supplies numerical support and reduces the proof to a concrete domination inequality.
- finite witness
- 4/5
- oracle cost
- 5/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
Exact recurrence computation for larger r; a mismatch refutes, while monotonicity/induction may prove. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.