Euclidean Algorithm GCD
ID: com.nummolt.euclidean.algorithm
-
Phiên bản:
Varies with device
-
Cập nhật:
2022-09-12
Tải file APK ngay
Đảm bảo cài đặt an toàn, không thêm quảng cáo hay phần mềm độc hại
Mô tả của 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)
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)
Xem thêm
Euclidean Algorithm GCD Varies with device APK cho Android Varies with device+
Phiên bản | Varies with device cho Android Varies with device+ |
Cập nhật | 2022-09-12 |
Lượt tải | 1.000++ |
Kích thước tập tin | 1.452.419 bytes |
Quyền | xem các quyền |
Cập nhật mới |
Update to sdk29 Android 10 Minor detail fixed. |
Phiên bản cũ hơn:
- 1. LATEST. Euclidean Algorithm GCD Varies with device APK (2022-09-12, 1 MB)
- 2. Euclidean Algorithm GCD Varies with device APK (2020-10-06, 2 MB)
- 3. Euclidean Algorithm GCD 1.0.1 APK (2019-01-16, 1 MB)
- 4. Euclidean Algorithm GCD 1.0.0 APK (2017-05-31, 1 MB)
Xem thêm
Tương tự "Euclidean Algorithm GCD"
Được yêu thích
Xem thêm