I created a simple tool to find the greatest common divisor of two natural numbers using Euclidean Algorithm.

☆How to use☆

step1

Enter numerical values ​​for natural numbers α and β. The input range is 8 digits (1 to 99999999).

step2

When you tap (click) the automatic calculation button, the calculation result will be displayed in “Greatest Common Divisor”.

The value displayed for the number of calculations is the number of divisions when calculating manually using Euclidean Algorithm.

natural number α 　　　　

natural number β 　　　　

greatest common divisor 　

least common multiple 　　

Number of calculations 　　

ver.1.1
last updated on February.28.2021