Saturday

April 19, 2014

April 19, 2014

Posted by **Jennie** on Sunday, March 4, 2007 at 10:24pm.

It's true for n = 1. Assume that it is true for some n. Then the sum of the first n+1 natural integers can be obtained by dding the last number n+1 to n(n+1)/2. So, the assumption that it is true for n leads to the conclusion that for n+1 the sum must be:

n+1 + n(n+1)/2.

If the formula is correct for n+1 also, then this must be the same as:

(n+1)(n+2)/2.

Expanding out the last bracket gives:

(n+1)(n+2)/2 = (n+1)*n/2 + (n+1)*2/2 =

n+1 + n(n+1)/2.

Thank you Count Iblis

**Related Questions**

pre calc - If Sn represents the sum of the squares of the first n natural ...

Algebra II - In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 ...

computer sciece(Computation Theory) - Find the error in the following proof that...

math induction - prove the product of 4 consecutive integers is always divisible...

Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...

proof by mathematical induction - subject is PreCalulus. 2^(k+3) = and < (k+3...

discrete math - Could someone help me with this induction proof. I know its true...

math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...

Discreet Mathematical Structures - Use proof by contraposition to prove the ...

Discrete Math - Could someone help me with this induction proof. I know its true...