Permutations Question

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 2
Joined: Tue Jun 28, 2016 11:05 am

Permutations Question

by It'sGMATtime » Tue Jun 28, 2016 11:10 am

Timer

00:00

Your Answer

A

B

C

D

E

Global Stats

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

Junior | Next Rank: 30 Posts
Posts: 23
Joined: Tue Jun 28, 2016 6:39 am
Thanked: 8 times
Followed by:3 members
GMAT Score:780

by Danny@GMATAcademy » Tue Jun 28, 2016 11:16 am
A couple of video explanations for this question:

"Indirect" Method: https://www.youtube.com/watch?v=5LDYpUWG2HY

"Direct" Method: https://www.youtube.com/watch?v=TSpp5XbJE3A
Last edited by Danny@GMATAcademy on Sat Jan 07, 2017 6:58 am, edited 1 time in total.

User avatar
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

by GMATGuruNY » Tue Jun 28, 2016 11:49 am
It'sGMATtime wrote: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
Good arrangements = total arrangements - bad arrangements.

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

GMAT/MBA Expert

User avatar
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

by [email protected] » Tue Jun 28, 2016 9:42 pm
Hi It'sGMATtime,

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
Contact Rich at [email protected]
Image

Master | Next Rank: 500 Posts
Posts: 199
Joined: Sat Apr 26, 2014 10:53 am
Thanked: 16 times
Followed by:4 members
GMAT Score:780

by 800_or_bust » Wed Jun 29, 2016 6:32 am
It'sGMATtime wrote: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
An alternative approach using probabilities:

Total number of possible arrangements: 5!/2! = 120/2 = 60.

Probability that both I's are right next to each other: (2/5)(1/4) + (3/5)(1/2) = 2/5.

Probability that both I's are separated by at least one other letter: 1 - 2/5 = 3/5.

Total number of cases in which the I's are separated by at least one letter: 60 x 3/5 = 36.

Answer: D
800 or bust!

Master | Next Rank: 500 Posts
Posts: 234
Joined: Tue May 31, 2016 1:40 am
Thanked: 3 times

by Needgmat » Sat Jul 02, 2016 12:06 am
Good arrangements = total arrangements - bad arrangements.

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.
Hi GMATGuruNY ,

Can you please explain more why have we to do 5!/2!? I didn't get that part.

Many thanks in advance.

Kavin

GMAT/MBA Expert

User avatar
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

by [email protected] » Sat Jul 02, 2016 9:20 am
Hi needgmat,

When doing a permutation, you have to make sure that you don't count duplicate results. Here's a simple example:

IF we had 3 different letters (A, B, C) we could arrange them in 3! = 6 different ways:

ABC
ACB
BAC
BCA
CAB
CBA

IF we had a pair of duplicate letters though (A, A, B), then there would NOT be 6 different arrangements:

AAB
ABA
BAA

There's no different between the "first A" and the "second A", so we can't count an option twice (AAB and AAB are the same result). We have to divide the 3! by 2! (for the 2 As). 3!/2! = 3 options.

The same idea exists behind this question. We have 5 total letters but a pair of Is:

5!/2! = 60 arrangements

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image

GMAT/MBA Expert

User avatar
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

by Brent@GMATPrepNow » Wed Aug 23, 2017 4:45 pm
It'sGMATtime wrote: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
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
Brent Hanneson - Creator of GMATPrepNow.com
Image

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 7223
Joined: Sat Apr 25, 2015 10:56 am
Location: Los Angeles, CA
Thanked: 43 times
Followed by:29 members

Re: Permutations Question

by Scott@TargetTestPrep » Sun Feb 16, 2020 7:15 am
It'sGMATtime wrote:
Tue Jun 28, 2016 11:10 am
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
This is a permutation problem because the order of the letters matters. Let’s first determine in how many ways we can arrange the letters. Since there are 2 repeating Is, we use the indistinguishable permutations formula, and we see that we can arrange the letters in 5! / 2! = 120 / 2 = 60 ways.

We also have the following equation:

60 = (number of ways to arrange the letters with the I’s together) + (number of ways without the I’s together).

Let’s determine the number of ways to arrange the letters with the I’s together. Note that we treat the two I’s as a single item, so we are in essence finding the number of permutations of 4 items.

We have: [I-I] [D] [G] [T]

We see that with the I’s together, we have 4! = 24 ways to arrange the letters.

Thus, the number of ways to arrange the letters without the I’s together (i.e., with the I’s separated) is 60 - 24 = 36.

Answer: D

Scott Woodbury-Stewart
Founder and CEO
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews

ImageImage