Computer Science Foundations1

Typically we think of the sum of two or more numbers. To make this problem work, let's define sum for just one integer to be that integer. 

For your problem to turn in, you will write a proof. Use the proof technique of strong mathematical induction to prove this statement. 

For all integers, k  ≥ 1,  any sum of k multiples of five is also a multiple of 5.  

Notes: 

1. Write or type your work neatly and completely.

2. Submit a word document 

3.Showing this is true for one example is not proof that it is always true.