frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdős Problem #236 remains OPEN. Statement: Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$. Show that $f(n)=o(\log n)$. Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A039669, A109925.
A proposal; no authority until an accepted review event.
accept gate
0 of 4 on recordtimeline
vpr_8bfcdc4181d0b5c4SEMANTIC-EDGE DRAFT -> Erdos #9 (vf_83126944775b9ae4) [related, confidence 0.85]: 236 counts representations n=p+2^k while 9 is precisely the set of odd n with zero such representations; 9 is the support of {n: f(n)=0} for 236's counting function. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.proposed
reason
SEMANTIC-EDGE DRAFT -> Erdos #9 (vf_83126944775b9ae4) [related, confidence 0.85]: 236 counts representations n=p+2^k while 9 is precisely the set of odd n with zero such representations; 9 is the support of {n: f(n)=0} for 236's counting function. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
provenance
proposed by
agent:semantic-edge-extractor
actor type
human
created at
2026-06-10
target type
finding
affected
inspect finding →Erdős Problem #236 remains OPEN. Statement: Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$. Show that $f(n)=o(\log n)$. Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A039669, A109925.
vf_c0263b896779ea89Read-only frontier; diff not recomputed.
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.
Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.