Algorithme de recherche du terme d'une suite (1)

On considère la suite (u n) définie par u 1=7 et u n+1=10u n9, pour tout entier naturel n.
Écrire un algorithme permettant de calculer le terme u n où n est un entier supérieur où égal à 2.

L'utilisateur rentre la valeur de n et l'ordinateur affiche u n.

Entrée transparent transparent
Initialisation transparent transparent
Traitement transparent transparent
transparent transparent
transparent transparent
Sortie transparent transparent


transparent transparent transparent transparent transparent transparent transparent transparent transparent transparent transparent transparent transparent transparent

This is exercise number 1 in a series of 5 exercises.
  • 1
  • 2
  • 3
  • 4
  • 5

This page is not in its usual appearance because WIMS is unable to recognize your web browser.
In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.