SOLUTION: prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using mathematical induction.

Algebra ->  Proofs -> SOLUTION: prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using mathematical induction.      Log On


   

Question 929683: prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using mathematical induction.
Answer by Edwin McCravy(20055) About Me  (Show Source):
You can put this solution on YOUR website!
prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using mathematical induction.
First we want to show that 

if n were some integer for which the formula 5n%28n%2B1%29%2F2 gives the sum of
the first n positive multiples of 5, from 5 through 5n, then the same formula
with (n+1) substituted for n, would give the sum of the first n+1 positive
multiples of 5, from 5 up to 5(n+1).

Let's hypothetically suppose that n is some integer for which the formula
5n%28n%2B1%29%2F2 gives the sum of the first n positive multiples of 5

If that were the case then if we added 5(n+1) to it we would have the sum
of the first n+1 multiples of 5.  So let's add 5(n+1) to the formula to see if
we get the formula 5n%28n%2B1%29%2F2 with n+1 substituted for n.

When we add them we get:

 5n%28n%2B1%29%2F2%22%22%2B%22%225%28n%2B1%29

We get an LCD:

 5n%28n%2B1%29%2F2%22%22%2B%22%2210%28n%2B1%29%2F2

%285n%28n%2B1%29%2B10%28n%2B1%29%29%2F2

We factor out (n+1) on top:

 %28%28n%2B1%29%285n%2B10%29%29%2F2

We factor out 5 from the second paretheses on top:

 %28%28n%2B1%29%285%29%28n%2B2%29%29%2F2

 %285%28n%2B1%29%28n%2B2%29%29%2F2

And now we see if this is what we'd get if we substituted n+1 for 
n in the formula 5n%28n%2B1%29%2F2, so we substitute n+1 for n in it
to see:

%285%28n%2B1%29%28%28n%2B1%29%5E%22%22%2B1%29%29%2F2

%285%28n%2B1%29%28n%2B1%2B1%29%29%2F2

%285%28n%2B1%29%28n%2B2%29%29%2F2

Yes that is what we got.

So therefore if we can find a value of n for which the formula
%285%28n%2B1%29%28n%2B2%29%29%2F2 will give the sum of the first n positive
multiples of 5, then it will also give us the sum of the first
n+1 positive multiples of 5.

So all that's left is to find such a value of n.

Let's try n=1 to see if the formlaq holds for that:

5n%28n%2B1%29%2F2
5%281%29%281%2B1%29%2F2
5%282%29%2F2
10%2F2
5

Indeed it works for n=5 because the first positive multiple of 5 is 5.

So therefore since the formula holds when n=1, from what we proved above,
the formula will also hold when n=1+1=2.

So therefore since the formula holds when n=2, from what we proved above,
the formula will also hold when n=+1=3.

So therefore since the formula holds when n=3, from what we proved above,
the formula will also hold when n=3+1=4.

etc., etc., etc.,

This never stops, so the formula holds for all integers n.

[Many books teach you to do the second part first and the first part second, 
so you can reverse them if you like.]

Edwin