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_c4a87c880934fe3a"}
- id
- vea_2ff3e41e62bb4f8c
- frontier
- Erdős problems frontier
- source
- vs_a00e1e54651a69d0
- finding
- vf_5300268135fc4490
finding binding
boundopen_question
Erdős Problem #931 remains OPEN. Statement: Let $k_1 \geq k_2 \geq 3$. Are there only finitely many $n_2\geq n_1 + k_1$ such that $$ \prod_{1\leq i\leq k_1}(n_1 + i)\ \text{and}\ \prod_{1\leq j\leq k_2} (n_2 + j) $$ have the same 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_c4a87c880934fe3a
vs_a00e1e54651a69d0
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_c4a87c880934fe3a"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_f7b2163e7d064a99
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_a4a156912a7bd457finding.assertedCandidate claim vc_c4a87c880934fe3a imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_647df57268cbb2eafinding.addCandidate claim vc_c4a87c880934fe3a imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.