Prime Factorization: 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 two pieces
Write the value of in prime-power form.
- Hint 1
Break down each of the two factors into primes.
- Hint 2
Collect the prime factors from both pieces into one product, listing primes from smallest to largest.
Answer
.
Full solution
Break each factor into its prime pieces.
Both branches now contain primes only.
Putting the leaves together gives
No prime repeats, so no exponent above is needed.
Both forms multiply to .
Answer
.
Key idea
The prime factors of a product come from completing the breakdown of each factor.
- Hint 1
-
Problem 2 The division record
A record shows the numbers , , , , in that order. Each new number was obtained by dividing the previous one by the smallest prime that divides it exactly. What divisors were used, in order?
- Hint 1
Each divisor is the missing factor connecting two neighboring numbers in the record.
- Hint 2
Divide the earlier number by the later number at each step.
Answer
, , .
Full solution
Reconstruct each exact division.
These are all primes.
They are also the smallest primes that fit at their respective steps: is even; is odd, has digit sum , and does not end in or ; and is itself prime.
Answer
, , .
Key idea
An exact division record preserves the prime factor removed at every step.
- Hint 1
-
Problem 3 The covered leaves
A completed factor tree starts at . It has four leaves: two of them show and , and the other two are covered. What are the covered leaves?
- Hint 1
The product of all the leaves of a completed tree equals the number at its top.
- Hint 2
Divide by the product of the two visible leaves to find what the covered leaves multiply to.
- Hint 3
Each covered leaf is prime, so split that product into two primes.
Answer
and .
Full solution
The two visible leaves have product
The two covered leaves supply the rest of the product.
So the covered leaves are two primes whose product is .
The only way to write as a product of two primes is , so both covered leaves are .
Check by multiplying all four leaves.
Answer
and .
Key idea
Dividing the top of a tree by its visible leaves shows what the covered leaves must multiply to.
- Hint 1
-
Problem 4 The shelf inventory
A cabinet has shelves with boxes on each shelf and clips in each box. Find the total number of clips and write that total in prime-power form.
- Hint 1
The total is the product of the three counts.
- Hint 2
Break down and before collecting repeated primes.
Answer
clips; .
Full solution
First count the boxes, then the clips.
Thus the cabinet holds clips.
For the prime factors, the is already prime, , and
Together these supply three s, one , and two s.
Check by multiplying the prime-power form back out.
Answer
clips; .
Key idea
Counts multiplied in a setting can also be broken into primes and collected into one factorization.
- Hint 1
-
Problem 5 The regrouped primes
A number has prime-power form . Regroup its prime factors to write the number as a product of two whole numbers that are each more than and less than . Give every such pair.
- Hint 1
Each member of a pair uses some of the prime copies, and its partner uses all the rest.
- Hint 2
Sort the possible members by whether or not they contain the prime .
- Hint 3
A member without the is built from s and at most one , so it is a factor of .
Answer
and .
Full solution
Multiplying out gives the number.
In a pair, one member uses some of these prime copies and its partner uses all the rest, so both members are factors of .
First take a member that contains the .
It is itself or , because any other choice adds a or a second to the and so is at least , which is over .
The partner of is made of all the other primes.
The partner of is made of what is left after one and the .
This gives the pairs and , and every member is in range.
Now take a member without the .
It is built from s and at most one , so it is one of the factors , , , , , , , and of
Only and are in range, and their partners, and , give the two pairs already found.
Answer
and .
Key idea
Splitting the prime copies of a factorization into two groups gives a factor pair of the number.
- Hint 1
-
Problem 6 The branching record
At the first split of a factor tree, one branch ends at . The other branch splits into two numbers that are both . Find the number at the top, and write its finished prime factorization in prime-power form.
- Hint 1
Rebuild the number from the two branches, then finish splitting any composite numbers.
- Hint 2
Each contributes two copies of .
Answer
; .
Full solution
The branch that splits into two s has value
Combining it with the other branch gives the original number.
Each splits into , so the two s contribute four copies of in all.
The remaining leaf is the prime .
The power equals , checking the original branch.
Answer
; .
Key idea
Each repeated composite branch must contribute all its prime copies to the final count.
- Hint 1
-
Problem 7 The stopping point
Start with and repeatedly divide by the smallest prime that fits. Stop as soon as the current quotient is prime. Give all the quotients reached up to that stopping point and write in prime-power form.
- Hint 1
Use the divisibility rules on the current quotient after each division.
- Hint 2
Keep removing while the quotient is even, then test and in order.
Answer
Quotients: ; .
Full solution
The first two divisions remove while the current number is even.
The quotient is odd and has digit sum , so its smallest prime divisor is .
The quotient is not divisible by or , but ends in .
The current quotient is now the prime , so the requested stopping point is reached.
Include that last prime with the divisors already used.
Multiplying the prime factors gives .
Answer
Quotients: ; .
Key idea
If repeated division stops at a prime quotient, that quotient still belongs in the factorization.
- Hint 1
-
Problem 8 The factor requirement
A student says the prime factorization of a composite number must contain at least two different primes. Does support or disprove the claim? Explain.
- Hint 1
A prime can occur several times without introducing a different prime.
- Hint 2
After ruling out , , and , work upward through the next primes in turn.
Answer
disproves the claim; .
Full solution
The number is odd, its digit sum is , and it does not end in or , so , , and do not divide it.
The next prime, , does not divide it either, since leaves a remainder of .
The prime does divide it.
Dividing again by leaves the prime .
Thus
So is composite, yet every factor in its prime factorization is the same prime.
It disproves the claim: a prime factorization needs prime factors, not two different primes.
Answer
disproves the claim; .
Key idea
A composite number's prime factorization can consist of copies of a single prime.
- Hint 1
-
Problem 9 The two methods
A student says that a completed factor tree and repeated division by the smallest prime always give the same number of copies of each prime, for every whole number greater than . Is this correct? Explain.
- Hint 1
Ask what the primes produced by each method multiply to.
- Hint 2
Both methods end in a list of primes, so compare two prime lists that have the same product.
- Hint 3
Recall what the Fundamental Theorem of Arithmetic says about writing a number as a product of primes.
Answer
Yes.
Full solution
Every split in a factor tree keeps the product the same, and a completed tree has only primes as leaves.
So its leaves are primes that multiply to the original number.
Repeated division by the smallest prime that fits uses only prime divisors and stops when the quotient reaches .
So its divisors are also primes that multiply to the original number.
By the Fundamental Theorem of Arithmetic, every whole number greater than has exactly one prime factorization apart from the order of the factors.
The two lists are both prime factorizations of the same number, so they contain the same primes with the same number of copies, and the student is correct.
Answer
Yes.
Key idea
Two methods that each end in a product of primes for the same number agree on every prime and its count.
- Hint 1
-
Problem 10 The proposed leaf
Could a correctly completed factor tree for have a leaf labeled ? Justify your answer without first multiplying by .
- Hint 1
Find the complete prime lists of the two displayed factors.
- Hint 2
Every correctly completed tree for the same number contains the same primes with the same counts.
Answer
No.
Full solution
Complete the breakdown of each displayed factor.
Together they give this prime-power form.
This completed prime list has three s, one , and one , with no .
Uniqueness of prime factorization forces any other correctly completed tree for the same number to have precisely that list, so a leaf labeled is impossible.
Answer
No.
Key idea
One complete prime factorization fixes which prime leaves any other correct tree can contain.
- Hint 1