CSC 344 - Algorithms and Complexity

Dr R. M. Siegfried

Assignment #1 - Some basic mathematical induction practice

Due Friday, January 27, 2017

If you can't read this correctly, there is a PDF version available.

  1. Prove by mathematical induction that i = 1 n i 2 = n ( n + 1 ) ( 2 n + 1 ) 6
  2. Prove by mathematical induction that i = 1 n i 3 = n 2 ( n + 1 ) 2 4
  3. Prove by mathematical induction that i = 1 n 1 2 i = 1 - 1 2 n
  4. Prove by mathematical induction that i = 1 n a i a n + 1 - 1 a - 1
  5. Prove by mathematical induction that i = 1 n 2 i 2 n + 1 - 1

[Back to the Assignments Page]