frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdős Problem #279 remains OPEN. Statement: Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be written as $a_p+tp$ for some prime $p$ and integer $t\geq k$? Topics: number theory, covering systems, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
A proposal; no authority until an accepted review event.
accept gate
0 of 4 on recordtimeline
vpr_799071a47fcdbcb4SEMANTIC-EDGE DRAFT -> Erdos #7 (vf_6e126f3f5046840d) [shares_technique, confidence 0.6]: Both are covering-system questions over residues; constructing the a_p mod p covering of all large integers in 279 uses the same covering-congruence machinery as building covering systems in 7. -- 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 #7 (vf_6e126f3f5046840d) [shares_technique, confidence 0.6]: Both are covering-system questions over residues; constructing the a_p mod p covering of all large integers in 279 uses the same covering-congruence machinery as building covering systems in 7. -- 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 #279 remains OPEN. Statement: Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be written as $a_p+tp$ for some prime $p$ and integer $t\geq k$? Topics: number theory, covering systems, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
vf_a8fab4b7d1d7cb28Read-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.