In Chapter 1 we learned Gauss's trick for showing that for all positive integers n,
![1531_fb85f2c4-390b-4c4b-9c9a-9aeb877cb4c5.png](https://secure.tutorsglobe.com/CMSImages/1531_fb85f2c4-390b-4c4b-9c9a-9aeb877cb4c5.png)
Use the technique of asserting that if there is a counter-example, there is a smallest counter-example and deriving a contradiction to prove that the sum is n(n + 1)/2. What implication did you have to prove in the process?