recurrence.py

Created on October 11, 2021

588 Bytes

Prouvons par récurrence que pour
tout entier nEN : 
  "u(n)=...."


- Initialisation: pour n=O

......

La propriété est donc vraie au rang
0 et elle est donc initialisée.


- Héréfité : Soit k un entier.

Supposons que la propriété soit
vraie au rang k, c'est-à-dire : 
  'u(k)=........'

La propriété est-elle toujours
vraie au rang k+1 ?

......

donc la propriété est vraie au
rang k+1 et est héréditaire.


- Conclusion: 

La proposition est vraie 
au rang n=... et héréditaire,
donc d'après le principe de 
récurrence, "u(n)=..." pour tout
nEN.

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

Ensure the proper functioning of the site (essential cookies); and
Track your browsing to send you personalized communications if you have created a professional account on the site and can be contacted (audience measurement cookies).

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.

Accept and continue Continue without accepting