4.I.2E

Numbers and Sets | Part IA, 2004

Prove by induction the following statements:

i) For every integer n1n \geq 1,

12+32++(2n1)2=13(4n3n)1^{2}+3^{2}+\cdots+(2 n-1)^{2}=\frac{1}{3}\left(4 n^{3}-n\right)

ii) For every integer n1,n3+5nn \geq 1, n^{3}+5 n is divisible by 6 .

Typos? Please submit corrections to this page on GitHub.