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_15e972089108007f"}
- id
- vea_3f4240b128254737
- frontier
- Erdős problems frontier
- source
- vs_2a02bea24ba2660b
- finding
- vf_bd6f63049d1cb1f2
finding binding
boundopen_question
Erdős Problem #313 remains OPEN. Statement: Are there infinitely many pairs `(m, P)` where `m ≥ 2` is an integer and `P` is a set of distinct primes such that the following equation holds: $\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}$? Topics: number theory, unit fractions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A054377.
source binding
source-boundcap_61973ee16b553d57 · vc_15e972089108007f
vs_2a02bea24ba2660b
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_15e972089108007f"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_3098cdbef96fe4ea
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_da2013e43aa53b0ffinding.assertedCandidate claim vc_15e972089108007f imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_90f0648fc11ada49finding.addCandidate claim vc_15e972089108007f imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.