GCF Calculator — Greatest Common Factor with Euclidean Algorithm &
Find the Greatest Common Factor (also called GCD or HCF) of two numbers using both the Euclidean algorithm with step-by-step division and prime.
Greatest Common Factor
Results below
Enter Values
Euclidean Algorithm
24 = 36 × 0 + 24 | 36 = 24 × 1 + 12 | 24 = 12 × 2 + 0 | GCF(24, 36) = 12
Prime Data
{"a":[{"factor":2,"exponent":3},{"factor":3,"exponent":1}],"b":[{"factor":2,"exponent":2},{"factor":3,"exponent":2}],"shared":[{"factor":2,"exponent":2},{"factor":3,"exponent":1}]}
Shared Prime Factors
2^2 × 3^1
Scenario Comparison
Embed Code
Copy and paste this HTML snippet into any web page to embed this calculator directly.
<iframe src="http://127.0.0.1:59362/embed/math/gcf-calculator?ref=embed" title="GCF Calculator — Greatest Common Factor with Euclidean Algorithm &" width="100%" style="max-width:600px; border:none; height:500px;" loading="lazy"></iframe>
Direct Link
Share this link to let others open the calculator in their browser.
Greatest Common Factor
GCF(24, 36) = 12
Euclidean Algorithm
24 = 36 × 0 + 24
36 = 24 × 1 + 12
24 = 12 × 2 + 0
GCF(24, 36) = 12
Factors of 24
2^3 · 3^1
Factors of 36
2^2 · 3^2
Related Calculators
Reviews
No reviews yet. Be the first to share your experience with GCF Calculator — Greatest Common Factor with Euclidean Algorithm &.
Write a Review