Prove that .

for n in the set of all positive numbers.

Base case is obvious.

So, tried using n = k, and adding k+1.

But then I get a load of terms and it gets too messy to handle.

Any advice?

Printable View

- April 6th 2010, 11:28 AMBlackBlazeInduction Proof
Prove that .

for n in the set of all positive numbers.

Base case is obvious.

So, tried using n = k, and adding k+1.

But then I get a load of terms and it gets too messy to handle.

Any advice? - April 6th 2010, 12:42 PMDrexel28