Consider the Following Program Segment Invariant

Short Answer

Consider the following program segment: $$\begin{array} { l } i : = 1 \\\text { total } : = 1 \\\text { while } i < n \\\quad i : = i + 1 \\\quad \text { total } : = \text { total } + i\end{array}$$ $$\text { Let } p \text { be the proposition "total } = \frac { i ( i + 1 ) } { 2 } \text { and } i \leq n . " \text { Use mathematical induction to prove that } p \text { is a loop }$$ invariant.