olymmath

CMO 2011 Problem 5

  • Paper

Let dd be a positive integer. Show that for every integer SS, there exists an integer n>0n>0 and a sequence ϵ1,ϵ2,…,ϵn\epsilon_{1}, \epsilon_{2}, \ldots, \epsilon_{n}, where for any k,ϵk=1k, \epsilon_{k}=1 or ϵk=−1\epsilon_{k}=-1, such that

S=ϵ1(1+d)2+ϵ2(1+2d)2+ϵ3(1+3d)2+⋯+ϵn(1+nd)2S=\epsilon_{1}(1+d)^{2}+\epsilon_{2}(1+2 d)^{2}+\epsilon_{3}(1+3 d)^{2}+\cdots+\epsilon_{n}(1+n d)^{2}

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator ca-cmo/2011/p5 · Tag CRPQ8EY3FG · Edit this page on GitHub · Keys: j next, k previous