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_f92d5053d68be954"}
- id
- vea_08268984d6d77e7e
- frontier
- Erdős problems frontier
- source
- vs_22221c5cde8d3ae2
- finding
- vf_9e28c1023d4edd6c
finding binding
boundopen_question
Erdős Problem #458 has status 'falsifiable'. Statement: Let $\operatorname{lcm}(1, \dots, n)$ denote the least common multiple of $\{1, \dots, n\}$. Let $p_k$ be the $k$-th prime. Is it true that for all $k \geq 1$, $\operatorname{lcm}(1, \dots, p_{k+1}-1) < p_k \cdot \operatorname{lcm}(1, \dots, p_k)$? Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A056604.
source binding
source-boundcap_61973ee16b553d57 · vc_f92d5053d68be954
vs_22221c5cde8d3ae2
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_f92d5053d68be954"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_2af47658bdf80da4
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_c0c630fa5e74fd31finding.assertedCandidate claim vc_f92d5053d68be954 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_100ed773ede14ca4finding.addCandidate claim vc_f92d5053d68be954 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.