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_f0923e08cba7fd09"}
- id
- vea_378912872157fda6
- frontier
- Erdős problems frontier
- source
- vs_0b7834b3fbb813c7
- finding
- vf_b53818ef62d3672f
finding binding
boundopen_question
Erdős Problem #699 has status 'falsifiable'. Statement: **Erdős Problem 699.** Is it true that for every $1 \le i < j \le n / 2$ there exists a prime $p \ge i$ with $p \mid \gcd\big(\binom{n}{i}, \binom{n}{j}\big)$? Topics: number theory, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_f0923e08cba7fd09
vs_0b7834b3fbb813c7
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_f0923e08cba7fd09"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_17a3559ac91d1df9
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e712a152d6b36d53finding.assertedCandidate claim vc_f0923e08cba7fd09 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_d7f2fa1fe309e1a0finding.addCandidate claim vc_f0923e08cba7fd09 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.