GCF Calculator
GCF(a,b) via Euclidean algorithm: repeatedly replace larger by remainder until zero.48=18×2+12; 18=12×1+6; 12=6×2+0 → GCF=6
Free online tool
GCF Calculator
Enter two integers to find their GCF using the Euclidean algorithm.
Instant calculation
GCF Calculator
Enter two integers to find their GCF using the Euclidean algorithm.
Your result
Calculation
Your numbers stay in this browser. Nothing is uploaded or saved.
Three clear steps
How to use this calculator
- 01
Enter first number
Type the first integer.
- 02
Enter second number
Type the second integer.
- 03
See GCF
Calculate to see the greatest common factor.
The formula
How this calculation works
The greatest common factor is the largest integer that divides both numbers evenly.
Check the method
Worked examples
Each example follows the same formula used by the calculator.
GCF of 48 and 18?
48=18×2+12; 18=12×1+6; 12=6×2+0 → GCF=66Common questions
Questions about this calculation
What is the GCF Calculator?
The GCF Calculator helps you find the greatest common factor of two numbers. Enter your values and select Calculate to get an instant result.
How is the result calculated?
The greatest common factor is the largest integer that divides both numbers evenly.
Can you show an example?
Example: GCF of 48 and 18? — 6.
Is my data saved when I use the GCF Calculator?
No. All calculations run locally in your browser. Your inputs and results are never uploaded, stored or shared with anyone.
Is the GCF Calculator free to use?
Yes. The GCF Calculator is completely free. No account, sign-up or payment is required. It works on mobile, tablet and desktop.
Continue calculating