Greatest Common Divisor and Least
Common Multiple
Greatest Common Divisor (GCD) of a and b - answer Largest whole number that
divides into a and b
Finding GCD using the Intersection of Sets Method - answer List all of the divisors of
each number, find all the common divisors, pick the largest one
Finding GCD using the Prime Factorization Method - answer Find the prime
factorization of both numbers, determine which factors they have in common, multiply
these common factors together
Finding GCD using the Euclidean Algorithm Method - answer Divide bigger number by
smaller number and find the remainder, divide this number into the previously divisor,
keep repeating this method until the remainder is 0, the answer is the divisor when the
remainder is 0
Least Common Mutliple (LCM) of a and b - answerSmallest number that is a multiple of
both a and b
Finding LCM using the Intersection of Sets Method - answerList several multiples of
each number, find the smallest multiple they have in common (list more multiples if you
do not have anything in common)
Finding LCM using the Prime Factorization Method - answerFind the prime factorization
of both numbers, write down the factors they have in common crossing off each one
(this is the GCD), then write down the rest of the factors and multiply all together
Finding LCM using the GCD-LCM Product Method - answerGiven two numbers, a and
b, and their GCD, the LCM can be found using the following formula, GCD×LCM = a×b.
Common Multiple
Greatest Common Divisor (GCD) of a and b - answer Largest whole number that
divides into a and b
Finding GCD using the Intersection of Sets Method - answer List all of the divisors of
each number, find all the common divisors, pick the largest one
Finding GCD using the Prime Factorization Method - answer Find the prime
factorization of both numbers, determine which factors they have in common, multiply
these common factors together
Finding GCD using the Euclidean Algorithm Method - answer Divide bigger number by
smaller number and find the remainder, divide this number into the previously divisor,
keep repeating this method until the remainder is 0, the answer is the divisor when the
remainder is 0
Least Common Mutliple (LCM) of a and b - answerSmallest number that is a multiple of
both a and b
Finding LCM using the Intersection of Sets Method - answerList several multiples of
each number, find the smallest multiple they have in common (list more multiples if you
do not have anything in common)
Finding LCM using the Prime Factorization Method - answerFind the prime factorization
of both numbers, write down the factors they have in common crossing off each one
(this is the GCD), then write down the rest of the factors and multiply all together
Finding LCM using the GCD-LCM Product Method - answerGiven two numbers, a and
b, and their GCD, the LCM can be found using the following formula, GCD×LCM = a×b.
