You need to use mathematical induction to prove the formula for every positive integer n, hence, you need to perform the two steps of the method, such that:

Step 1: Basis: Show that the statement P(n) hold for n = 1, such that:

`1 = 1/2*(3*1-1) => 1 =2/2 => 1=1`

Step 2: Inductive step: Show that if P(k) holds,...

(The entire section contains 148 words.)

## Unlock This Answer Now

Start your **48-hour free trial** to unlock this answer and thousands more. Enjoy eNotes ad-free and cancel anytime.

Already a member? Log in here.