Free Practice Question
PS · Problem Solving
705-805
Combinations
How many positive five-digit multiples of 3 can be formed using the digits 0, 1, 2, 3, 4, and 5, without repeating any digit?
Answer Choices
Correct answer marked belowA
15
B
96
C
120
D
181
216
Correct
See the full step-by-step explanation
You can see the correct answer above. Sign in for free to unlock the complete worked solution.
Track your performance and improve
Get detailed analytics, unlock full explanations, and move up difficulty tiers as you practice.
Explanation
Preview
Official Explanation
Official
Official Solution:
First step: Our goal is to determine which 5 digits out of the given 6 will form a 5-digit number divisible by 3.
We have six digits: 0, 1, 2, 3, 4, 5. Their sum is .
For a number to be divisible by 3, the sum of its digits must be divisible by 3.
As the sum of the six given numbers is 15 (divisible by 3), the only 5-digit combinations that would yield a number divisible by 3 are and .
No other combinations of 5 digits from the given 6 will result in a number divisible by 3.
Second step: We have two sets of numbers: and .
Let's find out how many 5-digit numbers can be formed using these two sets:…
First step: Our goal is to determine which 5 digits out of the given 6 will form a 5-digit number divisible by 3.
We have six digits: 0, 1, 2, 3, 4, 5. Their sum is .
For a number to be divisible by 3, the sum of its digits must be divisible by 3.
As the sum of the six given numbers is 15 (divisible by 3), the only 5-digit combinations that would yield a number divisible by 3 are and .
No other combinations of 5 digits from the given 6 will result in a number divisible by 3.
Second step: We have two sets of numbers: and .
Let's find out how many 5-digit numbers can be formed using these two sets:…
Read the full explanation
Sign in for free to see the complete step-by-step solution to this question.
Comments
Sign in to join the discussion
No comments yet
Be the first to share your thoughts and help others understand it better.
Sign in to commentWhat this question tests
What it tests
Whether you can count arrangements and selections correctly — permutations vs. combinations.
Common trap
Overcounting: treating a selection as ordered when order does not matter, or forgetting to divide by duplicates.
Details
Difficulty
705-805
Type
PS
Category