Primes and Composites: 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 factor total
A whole number has exactly two distinct positive factors. Their sum is . What is the number?
- Hint 1
A whole number with exactly two distinct positive factors is prime.
- Hint 2
Its two factors must be and the number itself.
Answer
.
Full solution
The factors must be and the number itself, so subtract the first factor from their sum.
As a check, is odd, its digit sum is , and it does not end in or , so , , and do not divide it.
Division by , , and leaves a remainder.
The next prime candidate is , and passes , so no further trial is needed.
Its factors are exactly and .
Answer
.
Key idea
The two factors of a prime are one and the prime itself.
- Hint 1
-
Problem 2 Two even numbers
Both and are even. Classify each as prime or composite.
- Hint 1
Being even means is a factor, so ask what that factor adds to each number's list of factors.
- Hint 2
Compare the factor with and with the number itself: for which of the two numbers is it a new factor?
- Hint 3
A prime has exactly two distinct factors, and a composite has more than two.
Answer
is prime; is composite.
Full solution
The only whole numbers that divide are and .
That is exactly two distinct factors, so is prime.
The number is even, so divides it.
So is a factor of besides and itself.
Then has at least the three distinct factors , , and .
That is more than two, so is composite.
For , the factor is the number itself, so being even adds no new factor.
For every even number greater than , the factor is an extra one, which is why is the only even prime.
Answer
is prime; is composite.
Key idea
Every even number greater than has as a third factor, so is the only even prime.
- Hint 1
-
Problem 3 Four numbers sorted
Classify each of , , , and as prime, composite, or neither.
- Hint 1
Compare each number's count of distinct factors with the definitions of prime and composite.
- Hint 2
For each number above , try the tests for , , and first, then divide by where the stopping rule still requires it.
Answer
: neither; : prime; : composite; : composite.
Full solution
The number has only one distinct factor, itself, so it is neither prime nor composite.
The number is odd, its digit sum is , and it does not end in or , so , , and do not divide it.
Division by leaves a remainder.
The next prime candidate is , and passes , so is prime.
The number ends in , so is a factor besides and .
So is composite.
The digit sum of is , a multiple of , so is a factor besides and .
So is composite.
Answer
: neither; : prime; : composite; : composite.
Key idea
Counting distinct factors sorts a number: one factor means neither, two means prime, and more than two means composite.
- Hint 1
-
Problem 4 The inner factors
List every positive factor of other than and , and justify that your list is complete.
- Hint 1
Factors come in pairs, so each smaller partner you find also gives you its larger partner.
- Hint 2
Test each whole number from upward, and stop once the number times itself passes .
- Hint 3
The divisibility rules settle most candidates: is odd, ends in , and has digit sum .
Answer
, , , , , and .
Full solution
Factors come in pairs whose product is , and the smaller partner of a pair, times itself, is at most .
Since passes , every pair has a smaller partner from to .
The number is odd, so none of , , , , , and divides it.
Its digit sum is , a multiple of but not of , so divides it and does not.
It ends in , so divides it.
The candidates and need division.
So leaves a remainder and divides exactly.
Dividing by and by gives the partners and .
The factor pairs are , , , and , so the factors other than and are , , , , , and .
Answer
, , , , , and .
Key idea
Testing every possible smaller partner up to the stopping point finds every factor pair.
- Hint 1
-
Problem 5 The sorting cards
A sorter has a pile of cards numbered through . It sets aside the smallest card in the pile, removes every larger multiple of that number from the pile, and repeats until the pile is empty.
List the cards it sets aside, and list the cards it removes at the step where it sets aside .
- Hint 1
This is the Sieve of Eratosthenes, so each card set aside has no smaller card dividing it.
- Hint 2
Work through , , and first, and keep track of which cards are already gone before the step for .
- Hint 3
Once the card being set aside, times itself, passes , every card still in the pile is prime.
Answer
Set aside: , , , , , , , , , , , , , , , , . Removed at the step for : only.
Full solution
Setting aside removes every larger even card.
Setting aside next removes the odd multiples of still in the pile: , , , , , , , , and .
Setting aside then removes , , and , the multiples of that are still in the pile.
At the step for , its larger multiples up to are , , , , , , and .
Every one except has a factor of , , or and is already gone.
So is the only card removed at this step.
The next card in the pile is , and passes .
By the stopping rule every card still in the pile is prime: a composite card up to has a factor pair whose smaller partner is from to , since passes .
If that partner is , , , or , it divides the card directly; if it is or , the card is even.
So every composite card up to is a multiple of , , , or , and was removed at one of the first four steps.
Each remaining card is set aside in turn, and no more cards are removed.
The cards set aside are , , , , , , , , , , , , , , , , and .
Answer
Set aside: , , , , , , , , , , , , , , , , . Removed at the step for : only.
Key idea
A sieve removes each composite card at the step for the smallest prime that divides it.
- Hint 1
-
Problem 6 The display request
A display needs two prime numbers whose product is . Can the request be filled? Explain.
- Hint 1
If two primes multiply to , together they form one of its factor pairs.
- Hint 2
Consider separately the case where one prime is even and the case where both primes are odd.
- Hint 3
For two odd primes, the smaller one times itself is at most , so only a few odd candidates need testing.
Answer
No.
Full solution
Suppose two primes multiply to .
Then they form a factor pair of .
If one of them is , the other is forced.
But is even and greater than , so it has as an extra factor and is composite.
Otherwise neither prime is , so both are odd, because is the only even prime: every even number greater than has as a factor besides and itself.
The smaller prime, times itself, is at most , and passes , so it is one of , , , , and .
The digit sum of is and it ends in , so and do not divide it.
Division by and by leaves a remainder.
That leaves .
Its partner is even and greater than , so it is composite.
No pair of primes has product , so the request cannot be filled.
Answer
No.
Key idea
Checking the factor pairs of a number settles whether it is a product of two primes.
- Hint 1
-
Problem 7 The covered labels
Two covered labels each show a prime number strictly between and . What is the greatest possible distance between the numbers on the number line? Justify that no other allowed labels give a greater distance.
- Hint 1
The greatest distance comes from the smallest and the largest eligible labels, so find those first.
- Hint 2
After the tests for , , and , the candidates left are , , , and .
- Hint 3
Since passes every candidate, trial division by , , , and settles each one.
Answer
units.
Full solution
Every even number here is composite, and ends in .
The digit sums of , , , and are , , , and , so divides none of them.
The greatest distance uses the smallest and the largest eligible labels, so test from each end.
Since and , the prime candidates to try are , , , and .
The largest candidate, , fails at .
So it is composite, although none of the tests for , , and caught it.
Each trial leaves a remainder for .
So is prime, and it is the smallest eligible label.
Each trial leaves a remainder for as well.
So is prime, and it is the largest eligible label.
The widest separation is between these two.
Any other pair of eligible labels lies between and , so it is closer together.
Answer
units.
Key idea
The greatest distance between two primes in a range joins the smallest and the largest primes in it.
- Hint 1
-
Problem 8 The factor claim
A student says that every positive factor of a composite number must also be composite. Is the student right? Use the factors of to explain.
- Hint 1
Test the claim on the actual factors of , one factor at a time.
- Hint 2
Write as a product of two factors and classify each factor you find.
- Hint 3
A single factor of that is not composite is enough to settle the claim.
Answer
No; for example, is a factor of and is prime. The factors and are also not composite.
Full solution
Split into a factor pair.
So has the factor besides and , which makes composite.
Yet is prime, not composite.
One factor that is not composite is enough to disprove a claim about every factor.
The factor is another counterexample, since is neither prime nor composite, and so is the prime .
Answer
No; for example, is a factor of and is prime. The factors and are also not composite.
Key idea
Being composite describes a number, not each of its factors: divides every composite number and is never composite.
- Hint 1
-
Problem 9 The written list
Alex writes , , , as the factor list of and calls it composite. Is that classification valid? Explain.
- Hint 1
Repeated entries do not create new factors.
- Hint 2
Test whether has any factor besides the two different numbers Alex wrote.
Answer
No; is prime.
Full solution
The list contains only two distinct numbers, and .
Repeating them does not increase the factor count.
The number is odd, its digit sum is , and it does not end in or .
These observations rule out , , and .
Division by and by leaves a remainder.
The next prime candidate is , and passes .
There are no additional factors, so is prime.
Answer
No; is prime.
Key idea
Classification depends on different factors, not the number of times a factor is written.
- Hint 1
-
Problem 10 The five-divisor claim
A student claims that every whole number from to that is not divisible by any of , , , , and is prime. Is the claim correct? Explain.
- Hint 1
Think about what a composite number's factor pairs look like, and how large the smaller partner can be.
- Hint 2
The smaller partner of a factor pair, times itself, is at most the number, so compare with .
- Hint 3
Check that every whole number from to is divisible by at least one of , , , , and .
Answer
Yes, the claim is correct.
Full solution
Take a number from to that none of , , , , and divides, and suppose it were composite.
Then it has a factor pair whose smaller partner is greater than .
That smaller partner, times itself, is at most the number, so at most .
So the smaller partner is a whole number from to .
If the partner is , , , , or , it divides the number directly.
If it is , , , , or , it is even, so the number is even and divides it.
If it is , the number is a multiple of and so of .
Every case contradicts the choice of the number, so it cannot be composite, and it is prime.
The upper limit matters: is divisible by none of the five, yet it is composite.
Answer
Yes, the claim is correct.
Key idea
A composite number below has a factor pair whose smaller partner is from to , so one of , , , , and divides it.
- Hint 1