GCF and LCM: Core practice
10 practice problems for this lesson. Work on paper, use hints when you need them, and check the answer or the full solution when you are ready.
Difficulty: Core (core-course level)
0 of 10 completed · 0 skipped
Progress saved in this browser.
Progress can't be saved in this browser, so your choices last for this visit only.
-
Problem 1 The shared twos
Two numbers have prime-power forms and . What is the greatest power of that divides both numbers?
- Hint 1
A common factor must fit inside both prime lists.
- Hint 2
Compare how many copies of each number supplies.
Answer
, or .
Full solution
The first number has four copies of , and the second has five.
Both supply four copies, but the first does not supply a fifth.
Therefore is the greatest power of that divides both.
Answer
, or .
Key idea
A shared prime can appear in a common factor no more often than in the number with fewer copies.
- Hint 1
-
Problem 2 The required fives
Two numbers are and . What is the highest power of that divides every positive common multiple of the two numbers?
- Hint 1
A common multiple must contain enough prime copies for each number.
- Hint 2
Compare the demand for copies of in the two given numbers.
Answer
, or .
Full solution
The first number needs three copies of , and the second needs one, which three copies also cover.
A multiple of the first must contain all three copies, so every common multiple holds at least three copies of .
So divides every common multiple.
The LCM, , is itself a common multiple with only three copies of , so no higher power of divides every common multiple.
Answer
, or .
Key idea
A common multiple must hold each prime at least as often as the number with more copies of it.
- Hint 1
-
Problem 3 The two prime lists
Two numbers have prime-power forms and . What is their least common multiple?
- Hint 1
A common multiple must contain every prime copy that each number contains.
- Hint 2
For each prime, take the larger count found in either number.
Answer
, or .
Full solution
Go prime by prime.
The prime appears three times in the first number and not at all in the second, so take three copies.
The prime appears once and twice, so take two copies.
The prime appears only in the second number, once, so take one copy.
Multiply the highest powers together.
Check that both numbers, and , divide it.
Answer
, or .
Key idea
The LCM takes every prime that appears in either number, at its higher count.
- Hint 1
-
Problem 4 The shortcut in reverse
Use the listing method to find . Then use the product rule to find without listing any factors.
- Hint 1
The LCM is the first value shared by the two lists of multiples, and the product rule links it to the GCF.
- Hint 2
Once the LCM is known, divide the product by it.
Answer
LCM ; GCF .
Full solution
List multiples of each number until a value appears in both lists.
The multiples of begin , , , , , and those of begin , , , .
The first shared value is , so the LCM is .
For two numbers, the GCF times the LCM equals their product, so the GCF is the product divided by the LCM.
Thus the GCF is .
The prime powers agree: and share only the prime , and its lower power is .
Answer
LCM ; GCF .
Key idea
For two numbers, dividing their product by the LCM gives the GCF, just as dividing it by the GCF gives the LCM.
- Hint 1
-
Problem 5 The prize bags
A teacher has stickers and pencils. She splits all of them into identical prize bags, with none left over, so that each bag holds the same number of stickers and the same number of pencils. Every bag must hold at least pencils. What is the greatest number of bags she can make, and what does each bag contain?
- Hint 1
The number of bags must divide both totals, so list every number that divides both and .
- Hint 2
For each candidate, work out the pencils per bag and drop any count that gives fewer than .
Answer
bags, each with stickers and pencils.
Full solution
Each bag gets an equal share of both totals, so the number of bags must be a common factor of and .
The factors of are , , , , , , and , and all of them except and divide .
So the common factors are , , , , and .
The largest, , is the GCF, but it gives too few pencils.
Three pencils is fewer than the required .
The next common factor down is .
Each of the bags holds pencils, which meets the condition, and stickers, with nothing left over.
No number between and divides both totals, so bags is the greatest possible.
Answer
bags, each with stickers and pencils.
Key idea
An extra condition on each group can rule out the GCF, so check the smaller common factors in turn.
- Hint 1
-
Problem 6 The observation window
Two screens change at the same instant. After that, one changes every seconds and the other every seconds. At which times strictly between and seconds after the starting instant do they change together?
- Hint 1
Find the spacing between changes that happen together, then locate those times inside the stated window.
- Hint 2
Compare the prime factors of the two cycle lengths and take enough copies for both.
Answer
seconds and seconds after the starting instant.
Full solution
The cycle lengths have prime-power forms and
The screens change together after a common multiple of the lengths.
The smallest positive spacing, in seconds, is
The listing method agrees: positive multiples of begin , , , , , , , while those of begin , , .
The first shared entry is .
Each common change time must contain a , a and a , so it is a multiple of , and every multiple of is a multiple of both and .
Common changes occur at multiples of .
The previous multiple is , below the window, and the next is , above it.
Thus precisely the changes at and seconds qualify.
Answer
seconds and seconds after the starting instant.
Key idea
An LCM gives the spacing between coincidences, and the stated time window determines which coincidences count.
- Hint 1
-
Problem 7 The hidden pair
Two positive whole numbers have GCF and LCM , and neither number is or . Find the two numbers.
- Hint 1
Each number is a multiple of the GCF and a factor of the LCM.
- Hint 2
Use the product rule to find the product, then test each candidate pair's GCF.
Answer
and .
Full solution
The GCF divides both numbers, so each is a multiple of .
Both numbers divide the LCM, so each is also a factor of .
Write each number as times a whole number.
If times the whole number goes into some number of times, then the whole number goes into that same number of times, so it divides .
So each number is times a factor of .
Leaving out and , the candidates are , , , , and .
For two numbers, the GCF times the LCM equals their product.
The candidates that pair up to this product are and , and , and and .
Now test each pair's GCF.
The pair and has the common factor , and so does the pair and , since and
Both of those GCFs are larger than .
The remaining pair fits.
The lower powers give a GCF of , and the higher powers give an LCM of
So the numbers are and .
Answer
and .
Key idea
Both numbers are multiples of the GCF and factors of the LCM, which limits the search to a short list.
- Hint 1
-
Problem 8 The two answers
For and , a student reports GCF and LCM . Decide whether each answer is correct and explain any correction.
- Hint 1
A common factor must fit inside both numbers, while a common multiple must contain each number.
- Hint 2
Compare the counts of and , and notice which primes occur in just one number.
Answer
GCF is incorrect; the GCF is . LCM is correct.
Full solution
For a common factor, the two numbers supply at most two shared copies of and two shared copies of .
Neither nor is shared.
The proposed contains three copies of , but has only two, so does not divide .
A common multiple needs three copies of , three copies of , and both of the primes appearing in just one number.
Taking exactly these required copies gives the least common multiple, so the proposed LCM is correct.
Answer
GCF is incorrect; the GCF is . LCM is correct.
Key idea
The GCF respects the smaller supply of each prime, while the LCM meets the larger demand.
- Hint 1
-
Problem 9 Three matching numbers
Three positive whole numbers are all equal to the same number greater than . Can their GCF times their LCM equal the product of all three numbers? Explain.
- Hint 1
Try it on three copies of one number, such as , and .
- Hint 2
Count how many copies of the common number each side multiplies together.
Answer
No.
Full solution
Call the common number , with .
Its largest shared factor is , and its smallest positive shared multiple is also .
Thus
Their product contains two copies of , while the product of the three original numbers contains three.
Multiplying the positive quantity by the extra factor increases it.
The products are therefore unequal.
The rule for two numbers does not extend to this three-number setting.
Answer
No.
Key idea
For three equal numbers greater than one, multiplying the GCF and LCM leaves out one copy of the common number.
- Hint 1
-
Problem 10 The added prime
A student takes two positive whole numbers greater than , multiplies each by , and claims that their GCF and their LCM are each multiplied by . Is the claim correct? Explain.
- Hint 1
Compare the prime lists before and after multiplying each number by .
- Hint 2
Track the count of in each number before and after, and compare the lower and the higher count.
Answer
Yes; both the GCF and the LCM are multiplied by .
Full solution
Multiplying each number by adds one copy of to each prime list and changes no other prime count.
Each number may already hold some copies of , possibly none.
Both counts rise by one, so the lower of the two counts rises by one, and the new GCF is the old GCF times .
The higher count also rises by one, so the new LCM is the old LCM times .
The rules select the same counts as before for every other prime.
Answer
Yes; both the GCF and the LCM are multiplied by .
Key idea
Multiplying both numbers by the same prime multiplies both their GCF and their LCM by that prime.
- Hint 1