{"schema":"vela.problem-packet.v0.1","problem":67,"statement":"If $f:\\mathbb{N}\\to \\{-1,+1\\}$ then is it true that for every $C&#62;0$ there exist $d,m\\geq 1$ such that\\[\\left\\lvert \\sum_{1\\leq k\\leq m}f(kd)\\right\\rvert &#62; C?\\]","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A181740","name":"Number of sequences of length n over {1, -1} with Erdős discrepancy <= 2.","terms":"1,2,4,6,12,18,28,44,88,100,152,240,370,556,882,750,1500,2250,2784,4284,6438,6062,9526,14856,22944,26164,39528,35122,5480","url":"https://oeis.org/A181740"},{"id":"A237695","name":"Maximum length of a +- 1 sequence of discrepancy n.","terms":"0,11,1160","url":"https://oeis.org/A237695"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}