For prime n>3 with odd ord_n(3), |N(n,3)|=Σ_{j=0}^{r/2} C(r,j), where r=(n−1)/ord_n(3).
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For prime n>3 with odd ord_n(3), |N(n,3)|=Σ_{j=0}^{r/2} C(r,j), where r=(n−1)/ord_n(3). Open residue: Eligible primes with odd multiplicative order.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 4/5
The formula is explicit and each eligible prime gives a finite orbit/subspace enumeration with exact integer output.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
Enumerate the relevant cyclic subspaces or use factorization of x^n−1 over F3, then compare counts. — 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.