Let SK = \(\frac{1+2+...+ K}{K}\) and \(\displaystyle\sum_{j=1}^{n}S_j^2=\frac{n}{A}(Bn^2+Cn+D)\), where A,B,C,D∈N and A has least value. Then
We have: \[ S_K = \frac{k+1}{2}, \] \[ S_k^2 = \frac{k^2 + 1 + 2k}{4}. \] Thus, \[ \sum_{j=1}^{n} S_j^2 = \frac{1}{4} \sum_{j=1}^{n} (n(n+1)) + \sum_{j=1}^{n} (n(n+1)). \] We can simplify this further: \[ S_j = \frac{(n+1)(2n+1)}{6}. \] Solving for the other terms: \[ n = \frac{(n+1)}{6}. \] From this we can derive \(A = 24\), \(B = 2\), \(C = 9\), and \(D = 13\).
\[
A + B \text{ is divisible by } D
\]
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is: