File original(330 × 742 pixels, dimension del file: 12 KB, typo MIME: image/png)

Iste file proveni de Wikimedia Commons e pote esser usate per altere projectos. Le description de su pagina de description ibi es monstrate in basso.

Summario

Description
English: Euclid's algorithm for computing the greatest common divisor of two numbers, drawn as a flowchart.
Origine Obra proprie
Autor Wvbailey
Altere versiones
This math image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.


It is recommended to name the SVG file “Euclid flowchart 1.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.

Other versions

Licentia

Io, titular del derecto de autor sur iste obra, declara de publicar lo sub le sequente licentia:
w:ia:Creative Commons
attribution
Iste file es disponibile sub le licentia Creative Commons Attribution 3.0 Unported.
Tu es libere:
  • de condivider – de copiar, distribuer e transmitter le obra
  • de remixar – de adaptar le obra
Sub le sequente conditiones:
  • attribution – Tu debe dar information appropriate sur le autor, fornir un ligamine al licentia, e indicar si modificationes ha essite apportate. Tu pote facer lo de qualcunque maniera rationabile, ma non in alcun modo que suggere que le licentiator approba te o tu uso del obra.

Legendas

Adde un explanation de un linea de lo que iste file representa

Objectos representate in iste file

representa

Alcun valor sin elemento Wikidata

copyrighted anglese

Historia del file

Clicca sur un data/hora pro vider le file como appareva a ille tempore.

Data/HoraMiniaturaDimensionesUsatorCommento
actual15:17, 15 novembre 2012Miniatura pro le version de 15:17, 15 novembre 2012330 × 742 (12 KB)Hawky.diddizConverted to grey scale, optimized
23:14, 29 januario 2011Miniatura pro le version de 23:14, 29 januario 2011330 × 742 (35 KB)Wvbailey Category:Mathematical Proof
23:08, 29 januario 2011Miniatura pro le version de 23:08, 29 januario 2011330 × 742 (35 KB)Wvbailey Category:Mathematical proof
21:20, 18 januario 2011Miniatura pro le version de 21:20, 18 januario 2011360 × 860 (37 KB)Wvbailey{{Information |Description={{en|1=Euclid's algorithm for computing the greatest commonon divisor of two numbers, drawn as a flowchart.}} |Source={{own}} |Author=Wvbailey |Date= |Permission= |other_versions= }}

Le sequente pagina usa iste file:

Uso global de iste file

Le altere wikis sequente usa iste imagine: