حساب القاسم المشترك الأكبر والمضاعف المشترك الأصغر

The Greatest Common Divisor (GCD) — also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF) — and the Least Common Multiple (LCM) are two of the most fundamental concepts in number theory, with applications that span from simplifying fractions in primary school arithmetic to scheduling algorithms in computer science and gear ratio calculations in mechanical engineering. Our calculator computes both values for up to ten numbers simultaneously, using the Euclidean algorithm — one of the oldest algorithms in existence, dating to approximately 300 BCE and still among the most efficient — with full step-by-step working displayed so you can follow every division and remainder in the process. Understanding the steps, not just the answer, is what transforms this tool from a calculator into a learning instrument.

GCD and prime factorisation are inseparably linked: the GCD of two numbers can always be determined by finding their prime factorisations and taking the product of all common prime factors. Our Prime Number Checker reveals the complete prime factorisation of any number instantly — making it the ideal companion for understanding why two numbers have the GCD they do, rather than simply accepting the numerical result. Using both tools in tandem builds a genuinely deep understanding of multiplicative number theory.

LCM calculations have direct practical applications in everyday scheduling and planning. If one task repeats every 4 days and another every 6 days, the LCM (12) tells you when they will next coincide — a pattern that appears everywhere from bus timetable synchronisation to medication dosing schedules. For precise date arithmetic around these recurrences, our Date Calculator computes the exact number of days between any two dates — turning the abstract LCM result into a concrete, calendar-anchored planning date. Together, these tools bring the theory of integers into the lived texture of everyday time management.

What are GCD and LCM?

The Greatest Common Divisor (GCD) — also called Greatest Common Factor (GCF) or Highest Common Factor (HCF) — is the largest positive integer that divides all given numbers without a remainder. Example: GCD(12, 18) = 6, because 6 is the largest number that divides both. The Least Common Multiple (LCM) is the smallest positive integer that is divisible by all given numbers. Example: LCM(4, 6) = 12. These two values are mathematically related by the identity: GCD(a,b) × LCM(a,b) = a × b. Our calculator uses the Euclidean algorithm — one of the oldest algorithms in existence, dating to ~300 BCE — and shows every step so you can follow the process.

Real-world uses of GCD and LCM

GCD is used to simplify fractions to their lowest terms (e.g., 12/18 → divide both by GCD(12,18)=6 → 2/3). LCM is used whenever you need to find a common cycle: bus schedules synchronising at the same stop, medication doses given at different intervals that coincide, gear ratios in mechanical systems, and recurring payment cycles in finance. If two events repeat every 4 and 6 days respectively, LCM(4,6) = 12 tells you they next coincide in 12 days. Combine with our Prime Number Checker for deep number theory exploration.