What is Euclid's algorithm?

Repeatedly replace (a, b) with (b, a mod b) until b is 0. The GCF is the last non-zero remainder.

Showing steps helps students verify the calculation and understand the algorithm.

Online GCF Euclid's Algorithm

Find the Greatest Common Factor of two integers using Euclid's algorithm. Optionally show step-by-step work.

First integer

Second integer

Show steps

What is Euclid's algorithm?: Repeatedly replace (a, b) with (b, a mod b) until b is 0. The GCF is the last non-zero remainder.
Why show steps?: Showing steps helps students verify the calculation and understand the algorithm.

Celsius to Fahrenheit Converter

Convert Celsius to Fahrenheit and Fahrenheit to Celsius instantly. Free temperature converter.

Tip Calculator

Calculate tip and split the bill. Enter bill amount, tip percentage, and number of people.

Roman Numeral Converter

Convert numbers to Roman numerals and Roman numerals to numbers. Supports 1–3999.

Combinations Calculator

Calculate C(n,r) — the number of ways to choose r items from n without order. Uses n!/(r!(n-r)!).

Combinations with Replacement Calculator

Calculate the number of ways to choose r items from n with repetition allowed. Formula: C(n+r-1, r).

Even Permutations Calculator

Count how many permutations of n objects are even (expressible as an even number of swaps). For n ≥ 2, equals n!/2.