What is Greatest Common Divisor (GCD)?

Published on November 10, 2026 • Last updated November 10, 2026

Mathematical Formula Included

Official Definition

The greatest common divisor of two whole numbers is the largest number that divides both exactly, and dividing both numbers by it gives the simplest form of their ratio.

Detailed Explanation

In-Depth Guide

Key Takeaway

To reduce a ratio such as 1920:1080, find the greatest common divisor of the two numbers, here 120, and divide both by it to get 16:9.

The Euclidean algorithm finds the divisor by repeatedly replacing the larger number with the remainder of dividing it by the smaller one until the remainder is zero.

When the divisor is 1 the ratio cannot be simplified further, which is why sizes like 1366 x 768 give a long ratio such as 683:384.

Mathematical Formula

gcd(a, b) = gcd(b, a mod b), and gcd(a, 0) = a

Calculation Examples

gcd(1920, 1080): 1920 mod 1080 = 840; 1080 mod 840 = 240; 840 mod 240 = 120; 240 mod 120 = 0. So the divisor is 120 and 1920:1080 = 16:9.

Frequently Asked Questions

It is easiest with whole numbers. For decimals, scale both numbers by a power of ten until they are whole, then reduce.

The two numbers share only the factor 2, so the exact ratio is 683:384, very close to but not equal to 16:9.

Yes. They are two names for the same value.

What do you need to work out next?

Search 276+ free tools by name, or pick a category below. Every one runs instantly in your browser — no signup, nothing to install.

AI ADVISOR & COACH

Ask AI Advisor

Ask AI