Greatest Common Divisor Calculator
What is GCD?
The Greatest Common Divisor (GCD) is the largest positive integer that divides both numbers without a remainder. Also known as Greatest Common Factor (GCF).
How to Use
Use the gcd() function with two numbers separated by a semicolon:
gcd(48;18) → 6
Example Calculations
gcd(12;8) → 4
gcd(100;50) → 50
gcd(17;19) → 1 (coprime)
gcd(54;24) → 6
Quick Access
Press SHIFT+! to insert gcd( quickly. Try the examples above to see how it works!
Use Cases
GCD is useful for:
• Simplifying fractions
• Finding common factors
• Solving mathematical problems
• Cryptography applications
Large Numbers
The calculator works with large numbers:
gcd(1234;5678) → 2
gcd(270;192) → 6
Uses the Euclidean algorithm
Prime Factorization
Try the pfac() function for prime factorization (SHIFT+^):
pfac(60) → 2² × 3 × 5
pfac(48) → 2⁴ × 3
Other Features
This is a full scientific calculator! Press AC to clear and access all functions including graphing, trig, fractions, and more.