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_bd25308f25ad9c4d"}
- id
- vea_d5c4de8c3198f53d
- frontier
- Erdős problems frontier
- source
- vs_11a7aaf0775ec9c4
- finding
- vf_de9a430867c11135
finding binding
boundopen_question
Erdős Problem #686 remains OPEN. Statement: Can every integer $N≥2$ be written as $$N=\frac{\prod_{1\leq i\leq k}(m+i)}{\prod_{1\leq i\leq k}(n+i)}$$ for some $k≥2$ and $m≥n+k$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_bd25308f25ad9c4d
vs_11a7aaf0775ec9c4
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_bd25308f25ad9c4d"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_76e74f0a0d2d74f8
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e5f47b6e5a3953c4finding.assertedCandidate claim vc_bd25308f25ad9c4d imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_aa1ad76812fbecb9finding.addCandidate claim vc_bd25308f25ad9c4d imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.