Let \[S_{K}=\frac{1+2+\ldots+K}{K}\] and \[\sum_\limits{j=1}^{n} S_{j}^{2}=\frac{n}{A}\left(B n^{2}+C n+D\right)\], where \[A, B, C, D \in \mathbb{N}\] and A has least value. Then
Solutions · 1
Official solution
\[
∵Sk=k1+2+…+k=2kk(k+1)=2k+1
\]
\[
⇒Sk2=(2k+1)2=4k2+1+2k⇒j=1∑nSj2=41[j=1∑nk2+j=1∑n1+2j=1∑nk]
\]
\[
=41[6n(n+1)(2n+1)+n+22n(n+1)]=4n[6(n+1)(2n+1)+1+n+1]=24n[2n2+3n+1+6+6n+6]=24n[2n2+9n+13]
\]
On comparing, we get
\[
\mathrm{A}=24, \mathrm{~B}=2, \mathrm{C}=9, \mathrm{D}=13
\]
(A) A+B+C+D=48, which is not divisible by 5.
(B) A+C+D=46, which is divisible by 2(B).
(C) A+B=26
\[
5(D−C)=5(13−9)=20∴26=20
\]
(D) A+B=24+2=26, divisible by 13.