用GameLoop模拟器在電腦上玩Euclidean Algorithm GCD

Euclidean Algorithm GCD 電腦版

來自發行商 nummolt 的 Euclidean Algorithm GCD 能夠在安卓系統上運行。

現在，您可以在電腦上使用 GameLoop 模擬器流暢地玩 Euclidean Algorithm GCD。

在 GameLoop 遊戲庫或搜索結果中下載。 不需要再暢玩遊戲時盯著電池電量或被令人懊惱的來電打斷。

只需在電腦大屏幕上免費下載暢玩Euclidean Algorithm GCD 電腦版！

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)