evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_11b32bc7f6aeddf2"}
- id
- vea_6b1fded3f8b4c334
- frontier
- Erdős problems frontier
- source
- vs_2ad229267563bbf2
- finding
- vf_e989a9337c2d241c
finding binding
boundtheoretical
Erdős Problem #277 has been PROVED (Erdős's conjecture holds). Statement: Is it true that, for every $c$, there exists an $n$ such that $\sigma(n)>cn$ but there is no covering system whose moduli all divide $n$? This was answered affirmatively by Haight [Ha79]. Topics: number theory, covering systems. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_11b32bc7f6aeddf2
vs_2ad229267563bbf2
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_11b32bc7f6aeddf2"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_138c678f52089039
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_47a325b6f8c45716finding.assertedCandidate claim vc_11b32bc7f6aeddf2 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_b1c48cd52fd08f7afinding.addCandidate claim vc_11b32bc7f6aeddf2 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.