for some reason would not let me post the summation right
using weak induction
n
e i = (n(n+1))/2
i=1
(a) (1 point) show that p(1) is true, which completes the base case.
(b) inductive step:
i. (1 point) what is your inductive hypothesis?
ii. (1 point) what are you trying to prove?
iii. (2 points) complete the proof:

Step-by-step explanation:

We will prove by mathematical induction that, for every natural n,  

We will prove our base case to be true:

Base case:

For n=1,

Inductive hypothesis:  

Given a natural n,  

Now, we will assume the inductive hypothesis and then use this assumption, involving n, to prove the statement for n + 1.

Inductive step:

Observe that,

With this we have proved our statement to be true for n+1.   

In conclusion, for every natural n,

.

3333333333333333333333333333333333333333333333

step-by-step explanation: