Euclidean Algorithm GCD
Euclidean Algorithm GCD

Euclidean Algorithm GCD

by Maurici Carbó (nummòlt) app developer

Advertisement

Euclidean Algorithm GCD app development description

Animated Euclidean Algorithm
Greatest Common Divisor.
Useful to reduce fractions

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

Type: Full app developer
Category: Education
Other apps from:
Spain, Catalonia, Barcelona, Barcelona
Download links:
Download
Loading...

Euclidean Algorithm GCD app development screenshots

Euclidean Algorithm GCDEuclidean Algorithm GCDEuclidean Algorithm GCDEuclidean Algorithm GCDEuclidean Algorithm GCD

Euclidean Algorithm GCD app development videos