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_b066ed69be70317e"}
- id
- vea_c6992d4d450c1d43
- frontier
- Erdős problems frontier
- source
- vs_32635a453c3a2aa4
- finding
- vf_7f83879b783b6f56
finding binding
boundopen_question
Erdős Problem #1210 remains OPEN. Statement: Let $A\subseteq [1,n)$ be a set of integers such that $(a,b)=1$ for all distinct $a,b\in A$. Is it true that $\sum_{a\in A}\frac{1}{n-a}\leq \sum_{p < n}\frac{1}{p}+O(1)$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_b066ed69be70317e
vs_32635a453c3a2aa4
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_b066ed69be70317e"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_0bdd0f53bbf4e202
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_d004a7c063881498finding.assertedCandidate claim vc_b066ed69be70317e imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_fa617550702223fefinding.addCandidate claim vc_b066ed69be70317e imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.