For n ≥ 1, prove that n(n + 1)(2n + l)/6 is an integer.
[Hint: By the Division Algorithm, n has one of the forms 6k, 6k + 1, …, 6k + 5; establish the result in each of these six cases.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.