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_789451a03ad36be5"}
- id
- vea_23b53d4b032b68f3
- frontier
- Erdős problems frontier
- source
- vs_0b8a19740cd04697
- finding
- vf_e004726ecce96ed0
finding binding
boundopen_question
Erdős Problem #26 has status 'disproved (lean)'. Statement: Let $A\subset\mathbb{N}$ be infinite such that $\sum_{a \in A} \frac{1}{a} = \infty$. Must there exist some $k\geq 1$ such that almost all integers have a divisor of the form $a+k$ for some $a\in A$? This was formalized in Lean by Alexeev using Aristotle. Topics: number theory, divisors. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_789451a03ad36be5
vs_0b8a19740cd04697
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_789451a03ad36be5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_ff14492aefe7b777
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e66e71c52852223dfinding.assertedCandidate claim vc_789451a03ad36be5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_80cfe4020aa5e795finding.addCandidate claim vc_789451a03ad36be5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.