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_cf7f8ff82019e557"}
- id
- vea_92d3be9d4d7747db
- frontier
- Erdős problems frontier
- source
- vs_e701cdeba51d8567
- finding
- vf_a5d6ba4ed7fad752
finding binding
boundtheoretical
Erdős Problem #67 has been PROVED (Erdős's conjecture holds). Statement: **The Erdős discrepancy problem** If $f\colon \mathbb N \rightarrow \{-1, +1\}$ then is it true that for every $C>0$ there exist $d, m \ge 1$ such that $$\left\lvert \sum_{1\leq k\leq m}f(kd)\right\rvert > C?$$ This is true, and was proved by Tao [Ta16] Topics: discrepancy. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: A181740, A237695.
source binding
source-boundcap_61973ee16b553d57 · vc_cf7f8ff82019e557
vs_e701cdeba51d8567
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_cf7f8ff82019e557"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_46bef41a2ece5e1f
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_c7d2a093458dccdcfinding.assertedCandidate claim vc_cf7f8ff82019e557 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_b54f41b659692d13finding.addCandidate claim vc_cf7f8ff82019e557 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.