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_16bfbf5956fc63b3"}
- id
- vea_fc66959c8e8bafd4
- frontier
- Erdős problems frontier
- source
- vs_b622a32f07ae1dec
- finding
- vf_2d9460662bd45612
finding binding
boundopen_question
Erdős Problem #889 remains OPEN. Statement: Let $v(n,k)$ count the prime factors of $n+k$ which do not divide $n+i$ for $0\leq i < k$. Is it true that $v_0(n)=\max_{k\geq 0}v(n,k)\to \infty$ as $n\to \infty$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_16bfbf5956fc63b3
vs_b622a32f07ae1dec
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_16bfbf5956fc63b3"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_bfa733d83361827d
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_f5c9c06cbaa00214finding.assertedCandidate claim vc_16bfbf5956fc63b3 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_6fd6c7e0acacb496finding.addCandidate claim vc_16bfbf5956fc63b3 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.