Euclidean Algorithm GCD

Animated Euclidean Algorithm
Greatest Common Divisor.
Useful to reduce fractions

Visible Euclidean algorithm

GCD, also known as the greatest common factor (gcf), highest common factor (hcf), greatest common measure (gcm), or highest common divisor.

Dynamic and geometric representation of the algorithm.

Recursive algorithm
And Least Common Multiple deduced from GCD:
lcm(a,b) = a*b / gcd(a,b)

Useful to understand the gcd (Euclidean Algorithm) recursive code: (Java)

int gcd(int m, int n){
if(0==n){
return m;
}else{
return gcd(n,m%n);
}
}

Added Geometric visualization.
Algorithm executed by Dandelions coming from the nearby Mathematical Garden

Euclidean Algorithm History:
("The Pulverizer")

The Euclidean algorithm is one of the oldest algorithms in common use.
It appears in Euclid's Elements (c. 300 BC), specifically in Book 7 (Propositions 1–2) and Book 10 (Propositions 2–3).
Centuries later, Euclid's algorithm was discovered independently both in India and in China, primarily to solve Diophantine equations that arose in astronomy and making accurate calendars.
In the late 5th century, the Indian mathematician and astronomer Aryabhata described the algorithm as the "pulverizer", perhaps because of its effectiveness in solving Diophantine equations.

Acknowledgements:
Joan Jareño (Creamat) (Addition of lcm)
Read more
Collapse
3.5
8 total
5
4
3
2
1
Loading…

What's New

Update to sdk29 Android 10
Minor detail fixed.
Read more
Collapse

Additional Information

Updated
October 4, 2020
Size
1.9M
Installs
1,000+
Current Version
1.0.4
Requires Android
4.0.3 and up
Content Rating
Everyone
Permissions
Offered By
nummolt
Developer
Maurici Carbó C/ Sant Antoni Maria Claret, 324 Barcelona 08041 SPAIN
©2021 GoogleSite Terms of ServicePrivacyDevelopersAbout Google|Location: United StatesLanguage: English (United States)
By purchasing this item, you are transacting with Google Payments and agreeing to the Google Payments Terms of Service and Privacy Notice.