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_0051f6daaf69eaf5"}
- id
- vea_3ba66bf79827fcd9
- frontier
- Erdős problems frontier
- source
- vs_29623d3d65c5a698
- finding
- vf_ab6e620f701aa23a
finding binding
boundopen_question
Erdős Problem #873 remains OPEN. Statement: Let $A = \{a_1 < a_2 < \dots\} \subseteq \mathbb{N}$ and let $F(A,X,k)$ count the number of $i$ such that $[a_i,a_{i+1}, \dots ,a_{i+k−1}] < X$, where the left-hand side is the least common multiple. Is it true that, for every $\epsilon > 0$, there exists some $k$ such that $F(A,X,k) < X^\epsilon$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_0051f6daaf69eaf5
vs_29623d3d65c5a698
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_0051f6daaf69eaf5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_2fb5d18b977fc52e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_04fdf6af0aabdd64finding.assertedCandidate claim vc_0051f6daaf69eaf5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_3484acd18a3f2776finding.addCandidate claim vc_0051f6daaf69eaf5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.