File:Euclid flowchart 1.png

Original file (330 × 742 pixels, file size: 12 KB, MIME type: image/png)

Summary

Description
English: Euclid's algorithm for computing the greatest common divisor of two numbers, drawn as a flowchart.
Source Own work
Author Wvbailey
Other versions
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

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current15:17, 15 November 2012Thumbnail for version as of 15:17, 15 November 2012330 × 742 (12 KB)Hawky.diddizConverted to grey scale, optimized
23:14, 29 January 2011Thumbnail for version as of 23:14, 29 January 2011330 × 742 (35 KB)Wvbailey Category:Mathematical Proof
23:08, 29 January 2011Thumbnail for version as of 23:08, 29 January 2011330 × 742 (35 KB)Wvbailey Category:Mathematical proof
21:20, 18 January 2011Thumbnail for version as of 21:20, 18 January 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= }}

The following 2 pages use this file:

Global file usage

The following other wikis use this file: