Prove the following propositions:
1. .
2. .
3. .
Prove the following propositions:
1. .
2. .
3. .
1. For all real , we have: . Since , it follows that , hence for all real , .
2. Suppose that . We write: (third remarkable identity).
Thus, we have: so (since ). Therefore, .
3. For . Therefore, we have shown that there exists at least one natural number such that 11 divides .
## 2 Tuesday afternoon, 18th: Cécile Gachet
Introduction. This course provides exercises on the application of simple induction, and then presents some variants: double induction or more generally of order , strong induction, and descending induction. Finally, the related principle of infinite descent is briefly explained.
Let's start with some exercises to check that everything is fine with simple induction: