How many ways can the five digits 3, 3, 4, 5, 6 be arranged into a 5-digit number so that the two occurrences of the digit 3 are separated by at least one other digit?
(A) 48
(B) 36
(C) 24
(D) 18
(E) 12
Please, I need experts to help me out with the solution to this question. Thanks
How many ways can the five digits 3, 3, 4, 5, 6 be arranged
This topic has expert replies
-
- Moderator
- Posts: 772
- Joined: Wed Aug 30, 2017 6:29 pm
- Followed by:6 members
GMAT/MBA Expert
- [email protected]
- Elite Legendary Member
- Posts: 10392
- Joined: Sun Jun 23, 2013 6:38 pm
- Location: Palo Alto, CA
- Thanked: 2867 times
- Followed by:511 members
- GMAT Score:800
Hi Roland2rule,
We're asked for the number of different ways that the five digits 3, 3, 4, 5, 6 be arranged into a 5-digit number so that the two occurrences of the digit 3 are separated by at least one other digit. This question can be solved in a couple of different ways; you might find it helpful to break the total down into 'pieces'
Each of the non-3 digits can be in ANY spot, so there will be (3)(2)(1) = 6 options for every placement of the two 3s. Based on the 'restrictions in the prompt, the two 3s could be in any of the following spots:
1st and 3rd
1st and 4th
1st and 5th
2nd and 4th
2nd and 5th
3rd and 5th
With 6 possible placements for the two 3s and 6 options for each placement, there are (6)(6) total permutations.
Final Answer: B
GMAT assassins aren't born, they're made,
Rich
We're asked for the number of different ways that the five digits 3, 3, 4, 5, 6 be arranged into a 5-digit number so that the two occurrences of the digit 3 are separated by at least one other digit. This question can be solved in a couple of different ways; you might find it helpful to break the total down into 'pieces'
Each of the non-3 digits can be in ANY spot, so there will be (3)(2)(1) = 6 options for every placement of the two 3s. Based on the 'restrictions in the prompt, the two 3s could be in any of the following spots:
1st and 3rd
1st and 4th
1st and 5th
2nd and 4th
2nd and 5th
3rd and 5th
With 6 possible placements for the two 3s and 6 options for each placement, there are (6)(6) total permutations.
Final Answer: B
GMAT assassins aren't born, they're made,
Rich
GMAT/MBA Expert
- Brent@GMATPrepNow
- GMAT Instructor
- Posts: 16207
- Joined: Mon Dec 08, 2008 6:26 pm
- Location: Vancouver, BC
- Thanked: 5254 times
- Followed by:1268 members
- GMAT Score:770
One approach here is to first IGNORE the restriction (about the 3's not appearing together) and then subtract all of the outcomes that break that restriction. I'm sure someone will show that approach.Roland2rule wrote:How many ways can the five digits 3, 3, 4, 5, 6 be arranged into a 5-digit number so that the two occurrences of the digit 3 are separated by at least one other digit?
(A) 48
(B) 36
(C) 24
(D) 18
(E) 12
Please, I need experts to help me out with the solution to this question. Thanks
Here's another approach:
Take the task of arranging the 5 digits and break it into stages.
Stage 1: Arrange the 4, 5 and 6
We can arrange n unique objects in n! ways
So, we can arrange these 3 digits in 3! ways (6 ways)
So, we can complete stage 1 in 6 ways
TRICKY PART: We'll now add some spaces where the 3's can be placed.
So, for example, if in stage 1, we arranged three digits as 645, then we'll add spaces before and after each digit.
So, we'd get: _6_4_5_
We will place the two 3's in two of the 4 possible spaces.
This will ENSURE that the 3's are not together.
Stage 2: Select two spaces in which to place the 3's
Since the order in which we select the spaces does not matter, we can use combinations.
We can select 2 spaces from 4 spaces in 4C2 ways (6 ways)
So, we can complete stage 2 in 6 ways
By the Fundamental Counting Principle (FCP), we can complete the two stages (and thus arrange all 5 digits) in (6)(6) ways (= 36 ways)
Answer: B
--------------------------
Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch our free video: https://www.gmatprepnow.com/module/gmat- ... /video/775
You can also watch a demonstration of the FCP in action: https://www.gmatprepnow.com/module/gmat ... /video/776
Then you can try solving the following questions:
EASY
- https://www.beatthegmat.com/what-should- ... 67256.html
- https://www.beatthegmat.com/counting-pro ... 44302.html
- https://www.beatthegmat.com/picking-a-5- ... 73110.html
- https://www.beatthegmat.com/permutation- ... 57412.html
- https://www.beatthegmat.com/simple-one-t270061.html
MEDIUM
- https://www.beatthegmat.com/combinatoric ... 73194.html
- https://www.beatthegmat.com/arabian-hors ... 50703.html
- https://www.beatthegmat.com/sub-sets-pro ... 73337.html
- https://www.beatthegmat.com/combinatoric ... 73180.html
- https://www.beatthegmat.com/digits-numbers-t270127.html
- https://www.beatthegmat.com/doubt-on-sep ... 71047.html
- https://www.beatthegmat.com/combinatoric ... 67079.html
DIFFICULT
- https://www.beatthegmat.com/wonderful-p- ... 71001.html
- https://www.beatthegmat.com/permutation- ... 73915.html
- https://www.beatthegmat.com/permutation-t122873.html
- https://www.beatthegmat.com/no-two-ladie ... 75661.html
- https://www.beatthegmat.com/combinations-t123249.html
Cheers,
Brent
- GMATGuruNY
- GMAT Instructor
- Posts: 15539
- Joined: Tue May 25, 2010 12:04 pm
- Location: New York, NY
- Thanked: 13060 times
- Followed by:1906 members
- GMAT Score:790
Good arrangements = (all possible arrangements) - (bad arrangements).Roland2rule wrote:How many ways can the five digits 3, 3, 4, 5, 6 be arranged into a 5-digit number so that the two occurrences of the digit 3 are separated by at least one other digit?
(A) 48
(B) 36
(C) 24
(D) 18
(E) 12
All possible arrangements:
Number of ways to arrange 5 digits = 5! = 120.
But the five digits here include two identical 3's.
When an arrangement includes IDENTICAL elements, we must divide by the number of ways each set of identical elements can be ARRANGED.
The reason:
When the identical elements swap positions, the arrangement doesn't change.
Here, we must divide by 2! to account for the two identical 3's:
120/2! = 60.
Bad arrangements:
In a BAD arrangement, the two 3's are in adjacent positions.
To count the arrangements in which the two 3's are in adjacent positions, place the two 3's in a BLOCK, yielding the following list of 4 elements:
[33], 4, 5, 6
The number of ways to arrange the 4 elements {33}, 4, 5 and 6 = 4! = 24.
Good arrangements:
(all possible arrangements) - (bad arrangements) = 60 - 24 = 36.
The correct answer is B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Hi Roland2rule,
Arrangement without restriction = 5! / 2!
Arrangement with the restriction where both the I's are together = 4! 2! / 2! = 4!
(Method: subtracting what's not allowed from total)
Total = (5! / 2!) - 4! = 36. Option B.
Regards!
Arrangement without restriction = 5! / 2!
Arrangement with the restriction where both the I's are together = 4! 2! / 2! = 4!
(Method: subtracting what's not allowed from total)
Total = (5! / 2!) - 4! = 36. Option B.
Regards!