File:EuclidePGCD.png
EuclidePGCD.png (501 × 335 pixels, file size: 11 KB, MIME type: image/png)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
A snapshot of the software Geoplan in action, showing the Euclid algorithm for computing the Greatest common divisor (GCD) by removing squares from a rectangle. A java applet showing the concept with the interactive geometry software Geoplan. Construction Geoplan expliquant graphiquement l'algorithme d'Euclide pour le calcul du Plus Grand Commun Diviseur (PGCD): Dans la tradition grecque, en comprenant un nombre entier comme une longueur, un couple d'entiers comme un rectangle, leur PGCD est la taille du plus grand carré permettant de carreler ce rectangle. L'algorithme décompose ce rectangle en carrés, de plus en plus petits, par divisions euclidiennes successives, de la longueur par la largeur, puis de la largeur par le reste, jusqu'à un reste nul. Cet algorithme s'appelle l'anthyphérèse du Grec anthy = tour à tour et aphairesis = enlever. Une page java avec l'applet GeoplanJava démontrant le concept de manière dynamique. |
| Date | 3 January 2007 (original upload date) |
| Source | No machine-readable source provided. Own work assumed (based on copyright claims). |
| Author | No machine-readable author provided. Christian.Mercat assumed (based on copyright claims). |
Licensing
|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. |
  
|
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license. | |
| ||
| This licensing tag was added to this file as part of the GFDL licensing update. |
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 13:41, 3 January 2007 | | 501 × 335 (11 KB) | Christian.Mercat | Construction Geoplan expliquant graphiquement l'algorithme d'Euclide pouyr le calcul du Plus Grand Commun Diviseur (PGCD): Dans la tradition grecque, en comprenant un nombre entier comme une longueur, un couple d'entiers comme un rectangle, leur PGCD est |
File usage
The following page uses this file:
