File:Euclid's algorithm Inelegant program 1.png
Size of this preview: 280 × 600 pixels. Other resolutions: 112 × 240 pixels | 326 × 698 pixels.
Original file (326 × 698 pixels, file size: 44 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 |
English: Knuth's version of Euclid's algorithm for calculating the greatest common divisor, translated almost verbatim from Knuth's description (E0 - E3) cf Knuth 1973:2-4. |
| Date | |
| Source | Own work |
| Author | Wvbailey |
|
This diagram 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's algorithm Inelegant program 1.svg”—then the template Vector version available (or Vva) does not need the new image name parameter. |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
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.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 22:51, 30 January 2011 | | 326 × 698 (44 KB) | Wvbailey | Category:Mathematical proof |
| 20:38, 28 January 2011 |  | 584 × 704 (61 KB) | Wvbailey | {{Information |Description ={{en|1=Knuth's version of Euclid's algorithm for calculating the greatest common divisor, translated almost verbatim from Knuth's description (E0 - E3) cf Knuth 1973:2-4.}} |Source ={{own}} |Author =[[User:Wv |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
Global file usage
The following other wikis use this file:
- Usage on id.wikipedia.org
- Usage on sl.wikipedia.org
- Usage on vi.wikipedia.org
- Usage on zh-yue.wikipedia.org
