Runs in O(log(min(a,b))) steps; one of the oldest algorithms known.

Euclidean Algorithm Calculator

Find GCD using Euclidean algorithm

Number A

Number B

Formula

GCD(a,b) = GCD(b, a mod b)

Repeatedly divide and take remainder until remainder is 0.

48=2×18+12 → 18=1×12+6 → 12=2×6+0 → GCD=6.

Find the GCD of two numbers using the Euclidean algorithm with step-by-step division.

Calculate percentages, increases, and decreases

Add, subtract, multiply, and divide fractions

Calculate mean, median, and mode of numbers

Find standard deviation of a data set