Pilot Problem: Proof of a theorem by Nicomachus
The following is my solution to the following exercise from The Art of Computer Programming, Volume 1, Donald Knuth. Chapter: 1.2.1 (Mathematical Induction) Problem: 8 Statement: Prove the following theorem of Nicomachus (A.D. c. 100) by induction: 1^{3} = 1 2^{3} = 3 + 5 3^{3} = 7 + 9 + 11 4^{3} = 13 + 15 + 17 + 19