Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2004/ia/paper-4/2e/solution

For the odd-square sum, the initial case gives . Assume the formula at . Adding the next square gives
The initial case and this induction step prove for every positive integer .
For the divisibility assertion, . The change when is replaced by is
One of the consecutive integers is even, so the displayed change is divisible by . If is divisible by , its successor is too. Thus induction proves for every .

New to topics? Read the docs here!