recurrence.py

Created by alten01

Created on November 15, 2022

371 Bytes


u0 =
Un =

Montrons, par récurrence, que :
Pour tt n app. N,
Un > Un+1 > 2   C'est Pn

Initialisation
Pour n=0 
...
Pn vraie 

Heredite
Supposons Pn vraie, et montrons 
qu'alors Pn+1 est vraie aussi
Un+1 > Un+2 > 2     C'est Pn+1
Supposons Pn vraie:
Un > Un+1 > 2
-> Multiplier additioner pour
retrouver Pn+1

Conclusion
Pour tt n app. N,
Un > Un+1 > 2

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.