https://commons.wikimedia.org/wiki/File:Gcd_exercise.gif

=={{int:filedesc}}==
{{Information
|description={{en|1=This is an example of a set of two numbers which demonstrates the Euclidean algorithm expanded into a two-dimensional grid format that simultaneously reduces the GCD of an infinite set of numbers. Its JavaScript code is embedded into a [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/Testy_Westy.html webpage which is located here.] The JavaScript code, itself, is located [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/gcd.js here as a viewable text file with a JS extension.] Its stepwise demonstration is embedded into [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/tablature_format-gcd.html this webpage.] The PHP version of its stepwise demonstration is [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/tablature_format-gcd.php embedded here.] The PHP code, itself, is located [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/8th_order_phi.txt here as a viewable text file with a TXT extension.] This modification of the more commonplace procedure for finding the [[w:Greatest common divisor|GCD]] of two numbers resulted from studying the [http://vinyasi.info/Infinite%20Range%20of%20Golden%20Ratios/ Infinite Range of Golden Ratios] since it is also used as one of the methods for generating the infinite series of Golden Ratios. BTW, the extension of the [[w:Golden Ratio|Golden Ratio]] into an infinite series is due to redefining the [[w:Fibonacci number|Fibonacci series]] into a grid format.[[File:GCD-for-infinite-sets htm.pdf|thumb|This PDF contains the HTML code for a webpage which will simultaneously calculate the GCD from a set of integers which is equal to or more numerous than a pair, such as from: two or more integers.]]}}
|date=2016-06-26
|source={{own}}
|author=[[User:Vinyasi|Vinyasi]]
|permission=
|other versions=
}}

=={{int:license-header}}==
{{self|cc-by-sa-4.0}}

[[Category:Infinite Euclidean algorithm]]