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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_0db86165b746d1a4"}
- id
- vea_dfbd31c53cacdd61
- frontier
- Erdős problems frontier
- source
- vs_74ed88f826dd0d8b
- finding
- vf_578aedd21b24562b
finding binding
boundopen_question
Erdős Problem #891 remains OPEN. Statement: Let $2=p_1 < p_2 < \cdots$ be the primes and $k\geq 2$. Is it true that, for all sufficiently large $n$, there must exist an integer in $[n,n+p_1\cdots p_k)$ with $>k$ many prime factors? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_0db86165b746d1a4
vs_74ed88f826dd0d8b
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_0db86165b746d1a4"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_1f796bb7d11da3df
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_4e0bd3be95f068fbfinding.assertedCandidate claim vc_0db86165b746d1a4 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_9b1b8eb3713245c4finding.addCandidate claim vc_0db86165b746d1a4 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.