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_752162639ba97b7a"}
- id
- vea_45707ce981e14c3c
- frontier
- Erdős problems frontier
- source
- vs_ccbac0877850998c
- finding
- vf_82759dce6215e9ad
finding binding
boundopen_question
Erdős Problem #463 remains OPEN. Statement: Is there a function $f$ with $f(n)\to\infty$ as $n\to\infty$ such that, for all large $n$, there is a composite number $m$ such that $$ n + f(n) < m < n + p(m) $$ Here $p(m)$ is the least prime factor of $m$. Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_752162639ba97b7a
vs_ccbac0877850998c
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_752162639ba97b7a"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_58b72cbcbdb05da0
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_7e15ef58c6b3c9d2finding.assertedCandidate claim vc_752162639ba97b7a imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_755e74f03ed93674finding.addCandidate claim vc_752162639ba97b7a imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.