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_a7d6b1717dd9272b"}
- id
- vea_81a5cc9c81c9ff3d
- frontier
- Erdős problems frontier
- source
- vs_cf7c2bb4a0bbb18b
- finding
- vf_e5e19bef5239e1be
finding binding
boundopen_question
Erdős Problem #457 has status 'proved (lean)'. Statement: Is there some $\epsilon > 0$ such that there are infinitely many $n$ where all primes $p \le (2 + \epsilon) \log n$ divide $$ \prod_{1 \le i \le \log n} (n + i)? $$ This was formalized in Lean by Baretto and van Doorn using Aristotle. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A391668.
source binding
source-boundcap_61973ee16b553d57 · vc_a7d6b1717dd9272b
vs_cf7c2bb4a0bbb18b
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_a7d6b1717dd9272b"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_877f7a39f1e9788e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_d8e8208b29403c3cfinding.assertedCandidate claim vc_a7d6b1717dd9272b imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_4117976014fc5644finding.addCandidate claim vc_a7d6b1717dd9272b imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.