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_29ac5e819745a9b5"}
- id
- vea_b8cfd2a7e178dd0f
- frontier
- Erdős problems frontier
- source
- vs_77f8cef5d740bea8
- finding
- vf_4599cc6c9a4e4b14
finding binding
boundopen_question
Erdős Problem #849 remains OPEN. Statement: Is it true that, for every integer $t\geq1$, there is some integer $a$ such that ${n \choose k} = a$ with $1\leq k \le \frac{n}{2}$ has exactly $t$ solutions? Topics: number theory, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A003016, A003015, A059233, A098565, A090162, A180058, A182237.
source binding
source-boundcap_61973ee16b553d57 · vc_29ac5e819745a9b5
vs_77f8cef5d740bea8
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_29ac5e819745a9b5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_6efb6254a60efb1e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_d91f841b214998cefinding.assertedCandidate claim vc_29ac5e819745a9b5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_aff3fe9b22dd7019finding.addCandidate claim vc_29ac5e819745a9b5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.