Let n be a positive integer such that 1^3 + 2^3 + ... + n^3 is divisible by n + 3....
Check the final answer first, then review the worked steps.
Check the final answer first, then review the worked steps.
S_n = \frac{n^2(n+1)^2}{4} \equiv \frac{(-3)^2(-2)^2}{4} = \frac{9 \cdot 4}{4} = 9 \pmod{n+3}. \text{ For divisibility, } n+3 \mid 9 \cdot 4 = 36. \text{ Max } n+3 = 36 \implies n = 33.
The sum is $S_n = \frac{n^2(n+1)^2}{4}$. We require $n+3 \mid \frac{n^2(n+1)^2}{4}$, so $4(n+3) \mid n^2(n+1)^2$. Since $n \equiv -3 \pmod{n+3}$, $n^2 \equiv 9$ and $n+1 \equiv -2$. Thus $n^2(n+1)^2 \equiv 9(-2)^2 = 36 \pmod{n+3}$. We need $n+3$ to be a divisor of 36. The largest divisor of 36 is 36, so $n+3 = 36 \implies n = 33$.