File:Binary GCD algorithm visualisation.svg

Original file ‎(SVG file, nominally 512 × 576 pixels, file size: 7 KB)

This file is from a shared repository and may be used by other projects. Please see the file description page for further information.

File history

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

	Date/Time	Thumbnail	Dimensions	User	Comment
current	18:01, 21 August 2014		512 × 576 (7 KB)	commons>Cmglee	{{Information \|Description ={{en\|1=Visualisation of the use of the binary GCD algorithm to find the greatest common divisor (GCD) of 36 and 24. The GCD is thus 2<sup>2</sup> × 3 = 12. }} \|Source ={{own}} \|Author =[[User:Cmglee\|...

There are no pages that use this file.

This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.

If the file has been modified from its original state, some details may not fully reflect the modified file.

Short title	Binary GCD algorithm visualisation
Image title	Visualisation of the use of the binary GCD algorithm to find the greatest common divisor (GCD) of 36 and 24, by CMG Lee. The GCD is thus 2 ^ 2 * 3 = 12.
Width	100%
Height	100%