Math Help - Induction 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?

Originally Posted by BlackBlaze

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?

Hint
. That's easier to work with.