edited by
126 views
0 votes
0 votes
Suppose we want to prove the statement $S(n):$ $"$If $n\geq 2,$ the sum of the integers $2$ through $n$ is $\frac{(n+2)(n-1)}{2}"$

by induction on $n.$ To prove the inductive step$,$ we can make use of the fact that

  $2+3+4+......+(n+1)=(2+3+4+.....+n)+(n+1)$

Find$,$ in the list below an equality that we may prove to conclude the inductive part.
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
admin asked Apr 2, 2019
110 views
What is the concatenation of $X$ and $Y?$ [shown on-line by the Gradiance system from a stock of choices] is$:$
0 votes
0 votes
0 answers
2
admin asked Apr 2, 2019
156 views
The length of the string $X$ [shown on-line by the Gradiance system from a stock of choices] is$:$
0 votes
0 votes
0 answers
3