We help IT Professionals succeed at work.

# Math Induction

on
330 Views
I am trying to figure out a problem and need some help.
The problem is listed below.

Using induction, verify that each equation is true for every positive integer n.
1 · 2 + 2 · 3 + 3 · 4 + ......+ n ( n + 1 ) =       (n (n + 1)(n + 2) ) / 3

I can get the number 1 to work for n but numbers above that I cannot. Any help would be appreciated.
Comment
Watch Question

## View Solutions Only

CERTIFIED EXPERT
Most Valuable Expert 2014
Top Expert 2015

Commented:
Assuming it works for n (e.g. 1) you need to prove it works for n+1
Can you find the difference between the sum for n and the sum for n+1?

Commented:
I cannot get n+1 to work, although I may be doing something wrong. I do not understand induction much and this is the first time I have tried, although it has been a long night and day of trying :-(
Commented:
This one is on us!
(Get your first solution completely free - no credit card required)
Engineer
CERTIFIED EXPERT
Commented:
This one is on us!
(Get your first solution completely free - no credit card required)
Unlock the solution to this question.

Experts Exchange is the only place where you can interact directly with leading experts in the technology field. Become a member today and access the collective knowledge of thousands of technology experts.