See also: numbers , prime numbers.
It is useful for reducing fractions to be in its lowest terms. See below on methods to find GCD.
Least Common Multiple LCM of two integers is the smallest integer that is a multiple of both numbers. See below on methods to find LCM. Using this method, first find the prime factorization of each number.
Check the prime factors page to learn how to find prime factors of an integer. The common prime factors are 2, 2 and 3.
The greatest common divisor of 24 and 60 is the product of these common prime factors, i. First divide all the numbers by the smallest prime that can divide all of them.
The smallest prime that divides 24 or 60 is 2. Continue the steps until we can't find any prime number that can divide all the number on the right side.
This algorithm finds GCD by performing repeated division starting from the two numbers we want to find the GCD of until we get a remainder of 0. Using this method, first find the prime factorization of each number and write it in index form.
The least common multiple is the product of the each prime factors with the greatest power.
First divide all the numbers by the smallest prime that can divide any of them. If we know the greatest common divisor GCD of integers a and b , we can calculate the LCM using the following formula.
With Chegg Study , you can get step-by-step solutions to your questions from an expert in the field. If you rather get a study help, try 30 minutes of free online tutoring with Chegg Tutors.
Enter two or three positive whole numbers. I Do Maths.
GCD and LCM (fast & easy way)