The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
A) 12
B) 18
C) 24
D) 36
E) 48
OAD
5-letter strings as DIGIT or DGIIT
This topic has expert replies
- 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 = total arrangements - bad arrangements.The letters D, G, I, I, and T can be used to form 5-letter strings such as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
(A) 12
(B) 18
(C) 24
(D) 36
(E) 48
Total arrangements:
Number of ways to arrange 5 elements = 5!.
But 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 I's:
5!/2! = 60.
Bad arrangements:
In a bad arrangement, the two I's are in adjacent slots.
Let [II] represent the 2 adjacent I's.
Number of ways to arrange the 4 elements [II], D, G and T = 4! = 24.
Good arrangements:
Total arrangements - bad arrangements = 60-24 = 36.
The correct answer is D.
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
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
Another approach:rsarashi wrote:The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
A) 12
B) 18
C) 24
D) 36
E) 48
Take the task of arranging the 5 letters and break it into stages.
Stage 1: Arrange the 3 CONSONANTS (D, G and T) in a row
We can arrange n unique objects in n! ways.
So, we can arrange the 3 consonants in 3! ways (= 6 ways)
So, we can complete stage 1 in 6 ways
IMPORTANT: For each arrangement of 3 consonants, there are 4 places where the two I's can be placed. For example, in the arrangement DTG, we can add spaces as follows _D_T_G_
So, if we place each I in one of the available spaces, we can ENSURE that the two I's are never together.
Stage 2: Select two available spaces and place an I in each space.
Since the order in which we select the two 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 2 stages (and thus arrange all 5 letters) in (6)(6) ways (= 36 ways)
Answer: D
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
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 rsarashi,
Since the two "I"s cannot be side-by-side, there are a limited number of ways to arrange the 5 letters. As such, with a little permutation math and some 'brute force', we can map out the possibilities:
_ _ _ _ _
If the first letter is an I, then the second letter CANNOT be an I (it would have to be one of the other 3 non-I letters)...
i 3
From here, any of the remaining letters can be in the 3rd spot. After placing one, either of the remaining two letters can be in the 4th spot and the last letter would be in the 5th spot...
i 3 3 2 1
This would give us (3)(3)(2)(1) = 18 possible arrangements with an I in the 1st spot.
If a non-I is in the 1st spot and an I is in the 2nd spot, then we have...
3 i _ _ _
A non-I would have to be in the 3rd spot, then either remaining letter could be 4th...
3 i 2 2 1
This would give us (3)(2)(2)(1) = 12 possible arrangements
Next, we could have two non-Is to start off, then Is in the 3rd and 5th spots...
3 2 i 1 i
This would give us (3)(2)(1) = 6 possible arrangements
There are no other options to account for, so we have 18+12+6 total arrangements.
Final Answer: D
GMAT assassins aren't born, they're made,
Rich
Since the two "I"s cannot be side-by-side, there are a limited number of ways to arrange the 5 letters. As such, with a little permutation math and some 'brute force', we can map out the possibilities:
_ _ _ _ _
If the first letter is an I, then the second letter CANNOT be an I (it would have to be one of the other 3 non-I letters)...
i 3
From here, any of the remaining letters can be in the 3rd spot. After placing one, either of the remaining two letters can be in the 4th spot and the last letter would be in the 5th spot...
i 3 3 2 1
This would give us (3)(3)(2)(1) = 18 possible arrangements with an I in the 1st spot.
If a non-I is in the 1st spot and an I is in the 2nd spot, then we have...
3 i _ _ _
A non-I would have to be in the 3rd spot, then either remaining letter could be 4th...
3 i 2 2 1
This would give us (3)(2)(2)(1) = 12 possible arrangements
Next, we could have two non-Is to start off, then Is in the 3rd and 5th spots...
3 2 i 1 i
This would give us (3)(2)(1) = 6 possible arrangements
There are no other options to account for, so we have 18+12+6 total arrangements.
Final Answer: D
GMAT assassins aren't born, they're made,
Rich
GMAT/MBA Expert
- Jay@ManhattanReview
- GMAT Instructor
- Posts: 3008
- Joined: Mon Aug 22, 2016 6:19 am
- Location: Grand Central / New York
- Thanked: 470 times
- Followed by:34 members
Hi rsarashi,rsarashi wrote:The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
A) 12
B) 18
C) 24
D) 36
E) 48
OAD
What we want: 1. There is one letter among D, G, and T between the two 'I's. 2. There are two letters among D, G, and T between the two 'I's. 3. There are all three letter D, G, and T between the two 'I's.
What we do not want: No two 'I's are together.
Since it's easier to deal with 'What we do not want' than 'What we want,' let's go the other way.
# of ways the 'I's are separated = Total # of ways letters D, G, I, I, and T can make words (without any constraints) - Total # of ways the two 'I's are together
=> Total # of ways letters D, G, I, I, and T can make words (without any constraints) = 5! / 2! = 60; There are 5 letters (D, G, I, I, and T ) and two letters (I) are common.
=> Total # of ways the two 'I's are together = 4! = 24; considering the two 'I's as one letter
=> # of ways no 'I's are together = 60 - 24 = 36.
The correct answer: D
Hope this helps!
Relevant book: Manhattan Review GMAT Combinatorics and Probability Guide
-Jay
_________________
Manhattan Review GMAT Prep
Locations: New York | Frankfurt | Hong Kong | Zurich | and many more...
Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
GMAT/MBA Expert
- Jeff@TargetTestPrep
- GMAT Instructor
- Posts: 1462
- Joined: Thu Apr 09, 2015 9:34 am
- Location: New York, NY
- Thanked: 39 times
- Followed by:22 members
This is a permutation problem, because the order of the letters matters. Let's first determine the total number of ways we can arrange the letters. Using the indistinguishable permutations formula, which takes into account the 2 repeating Is, we can arrange the letters in 5!/2! = 120/2 = 60 ways.rsarashi wrote:The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
A) 12
B) 18
C) 24
D) 36
E) 48
We also have the following equation:
60 = (number of ways to arrange the letters with the Is together) + (number of ways without the Is together).
Let's determine the number of ways to arrange the letters with the Is together.
We have: [I-I] [D] [G] [T]
We see that with the Is together, we have 4! = 24 ways to arrange the letters.
Thus, the number of ways to arrange the letters without the Is together (i.e., with the Is separated) is 60 - 24 = 36.
Answer: D
Jeffrey Miller
Head of GMAT Instruction
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews