- Prove that
Proof. We use properties of finite sums to compute,The second to last inequality follows from the telescoping property. But then solving for the sum we are interested in, we have
- If we have (using this, and the fact that for )
The second to last inequality follows from the telescoping property. But then solving for the sum we are interested in, we have
[latextype]
for part b it states that \(\sum_{k=0}^{n} 1 = n + 1\) but in the referenced solution it shows that \( \sum_{k=0}^{n}1 = n \) so why is it different?
But in referenced solution it shows \( \sum_{k=1}^{n}1 = n \) Note that there is k = 1 and not k = 0 as is the case with this exercise. That’s why the solution is n + 1 and just n.