Answer:
See explanation
Step-by-step explanation:
1 step:
n=1, then
So, for j=1 this statement is true
2 step:
Assume that for n=k the following statement is true
3 step:
Check for n=k+1 whether the statement
is true.
Start with the left side:
According to the 2nd step,
Substitute it into the
So, you have proved the initial statement
Answer:
it not wrong to do it it's just not right to do it I get it
I do it too sometimes so it not just you
oh and can I have brainliest it would really help out
Answer:
-1
because you are adding up to 0 to get back to the positive.
Step-by-step explanation:
I'm not sure what you mean by 'written method' but the sum is 2,654.