CalculateMeasure

Math & Geometry

Greatest Common Factor Calculator

Find the greatest common factor of two positive integers using the Euclidean algorithm.

Get embed code

Calculator guide

How to use the Greatest Common Factor Calculator

Find the greatest common factor of two positive integers using the Euclidean algorithm. Enter the requested values and select Calculate. The result and supporting values are produced locally in your browser.

Formula

GCF(a, b) = largest positive integer that divides both a and b

Worked example

The GCF of 48 and 18 is 6.

What to keep in mind

  • The Euclidean algorithm finds the same GCF as comparing prime factorizations.

Methodology

This calculator uses deterministic arithmetic and performs the calculation locally in your browser. Verify assumptions, units, and source values for your specific use case.

Review standard: Level A · Standard formula. How calculator reviews work.

Frequently asked questions

What does this calculator calculate?

Find the greatest common factor of two positive integers using the Euclidean algorithm.

How is the result calculated?

GCF(a, b) = largest positive integer that divides both a and b.

Can I use the result for an important decision?

Use the result as a calculation aid and verify the inputs, assumptions, and applicable professional or regulatory requirements before relying on it for an important decision.

Does CalculateMeasure store the values I enter?

The calculator performs its arithmetic in your browser. The calculator itself does not need to send your entered values to a server to produce the result.