X

Join or Sign In

Sign in to add and modify your software

Continue with email

By joining Download.com, you agree to our Terms of Use and acknowledge the data practices in our Privacy Policy.

Euclidean Algorithm GCD for Android

By nummolt Free

Developer's Description

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 12) and Book 10 (Propositions 23).

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 Jareo (Creamat) (Addition of lcm)

Full Specifications

What's new in version 1.0.1

General

Release May 25, 2020
Date Added May 25, 2020
Version 1.0.1

Operating Systems

Operating Systems Android
Additional Requirements Requires Android 4.0.3 and up

Popularity

Total Downloads 0
Downloads Last Week 0
Report Software

Related Apps

TED

Free
TED

Star Chart

Free
Star Chart

Bible for Kids

Free
Bible for Kids

CES 6.0.0 Answers

Free
CES 6.0.0 Answers