Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Does GMAT RC seem like an uphill battle? e-GMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days.

Want to score 90 percentile or higher on GMAT CR? Attend this free webinar to learn how to pre-think assumptions and solve the most challenging questions in less than 2 minutes.

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

11 Mar 2019, 13:57

1

12

00:00

A

B

C

D

E

Difficulty:

95% (hard)

Question Stats:

31% (01:49) correct 69% (01:48) wrong based on 100 sessions

HideShow timer Statistics

A secretary types 4 letters and then addresses the 4 corresponding envelopes. In how many ways can the secretary place the letters in the envelopes so that NO letter is placed in its correct envelope?

A) 8 B) 9 C) 10 D) 12 E) 15

Official answer in spoiler below, anyone have a better explanation/approach?

The question stem asks how many ways, indicating that this is a combination/permutation question. First, recognize that this is a permutation question because the order of the letters to the envelopes matters. Unfortunately, the restriction that NO letter is placed in its correct envelope is so restrictive that it will be easier to list out the possibilities than to calculate them. Start with a single scenario and then extrapolate. For discussion, designate the letters L1, L2, L3 and L4, and designate the envelopes E1, E2, E3, and E4.

First, since L1 cannot be assigned to E1, assign L1 to E2. Then list out the possibilities for the remaining three letters such that NO letter is placed in its correct envelope. The only three possibilities are (L2 to E1, L3 to E4, L4 to E3), (L2 to E3, L3 to E4, L4 to E1), and (L2 to E4, L3 to E1, L4 to E3). There are 3 possible ways to assign the remaining letters when L1 assigned to E2. So, there must be 3 possible ways to assign the remaining letters with L1 assigned to E3, and there must be 3 possible ways to assign the remaining letters with L1 assigned to E4. Therefore, there are a total of 3 + 3 + 3 = 9 ways the secretary can place the letters in the envelopes so that NO letter is placed in its correct envelope.

Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

17 Mar 2019, 20:17

4

2

Assume the envelope positions are "locked" so that you are just arranging four letters among the four positions. Total number of ways to arrange four letters in four positions is 4! = 24

Now to subtract the number of ways in which one or more letters are in their right envelopes.

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

11 Mar 2019, 17:52

1

Top Contributor

energetics wrote:

A secretary types 4 letters and then addresses the 4 corresponding envelopes. In how many ways can the secretary place the letters in the envelopes so that NO letter is placed in its correct envelope?

A) 8 B) 9 C) 10 D) 12 E) 15

When we scan the answer choices (ALWAYS scan the answer choices before choose your plan of attack), we see that all of the answer choices are relatively small. So, a perfectly valid approach is to list and count the possible outcomes

Let a, b, c and d represent the letters, and let A, B, C and D represent the corresponding addresses.

So, let's list the letters in terms of the order in which they are delivered to addresses A, B, C, and D. So, for example, the outcome abcd would represent all letters going to their intended addresses. Likewise, cabd represent letter d going to its intended address, but the other letters not going to their intended addresses.

Now let's list all possible outcomes where ZERO letters go to their intended addresses: - badc - bcda - bdac - cadb - cdab - cdba - dabc - dcab - dcba

The mistake I made was in my break down of the problem: I thought that "any letter can go into any box besides it's own, so 3 out of 4 possibilities * 4 boxes (aA aB, aC, aD, bA, bB, bC, bD, etc... so 3*4 = 12)" This assumes replacement, which we are not doing in this problem.

If I understand right, it's more complicated because not only can the first letter not go into its own box, but the second can't go into its own, and so on... so we have to fulfill the constraint for every step, which results in less viable possibilities (should be 4! total... i.e. starting with each letter makes 1*3*2*1 = 6 possibilities * 4 letters, not 4^4 as I thought)

This was a lot more clear when I made a table. Everything that starts with A is out, and for the other 3 letters there are 3/6 possibilities. Some of them work up to a certain point. For example starting with B, you can fulfill the requirement for the first 3 slots with bcad, but not the fourth slot by having d in the fourth slot (corresponding to box D makes it nonviable) So it's actually 9/24.

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

15 Mar 2019, 06:40

energetics wrote:

A secretary types 4 letters and then addresses the 4 corresponding envelopes. In how many ways can the secretary place the letters in the envelopes so that NO letter is placed in its correct envelope?

A) 8 B) 9 C) 10 D) 12 E) 15

Official answer in spoiler below, anyone have a better explanation/approach?

The question stem asks how many ways, indicating that this is a combination/permutation question. First, recognize that this is a permutation question because the order of the letters to the envelopes matters. Unfortunately, the restriction that NO letter is placed in its correct envelope is so restrictive that it will be easier to list out the possibilities than to calculate them. Start with a single scenario and then extrapolate. For discussion, designate the letters L1, L2, L3 and L4, and designate the envelopes E1, E2, E3, and E4.

First, since L1 cannot be assigned to E1, assign L1 to E2. Then list out the possibilities for the remaining three letters such that NO letter is placed in its correct envelope. The only three possibilities are (L2 to E1, L3 to E4, L4 to E3), (L2 to E3, L3 to E4, L4 to E1), and (L2 to E4, L3 to E1, L4 to E3). There are 3 possible ways to assign the remaining letters when L1 assigned to E2. So, there must be 3 possible ways to assign the remaining letters with L1 assigned to E3, and there must be 3 possible ways to assign the remaining letters with L1 assigned to E4. Therefore, there are a total of 3 + 3 + 3 = 9 ways the secretary can place the letters in the envelopes so that NO letter is placed in its correct envelope.

The correct answer is choice B.

This concept has been explained really well by VeritasKarishma.

La can be put in either Eb or Ec or Ed (i.e. 3 ways). Say, La is put in Ec. Now we have 3 letters leftover: Lb, Lc and Ld and 3 envelopes leftover: Ea, Eb and Ed. Lc, the letter corresponding to Ec, can be put in any one of these three envelopes. Hence Lc can be put in 3 ways too. Say, Lc is put in Ed. Now, we have two letters, Lb and Ld leftover and two envelopes, Ea and Eb leftover. Lb cannot go into Eb so Lb must go into Ea and Ld must go into Eb i.e. there is only one way of putting in the other two letters. So, number of ways of putting in all the letters incorrectly = 3*3*1 = 9 ways.

Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

09 Dec 2019, 15:53

1

siyeezy wrote:

Assume the envelope positions are "locked" so that you are just arranging four letters among the four positions. Total number of ways to arrange four letters in four positions is 4! = 24

Now to subtract the number of ways in which one or more letters are in their right envelopes.

Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]

Show Tags

10 Dec 2019, 06:27

AnirudhChalla wrote:

siyeezy wrote:

Assume the envelope positions are "locked" so that you are just arranging four letters among the four positions. Total number of ways to arrange four letters in four positions is 4! = 24

Now to subtract the number of ways in which one or more letters are in their right envelopes.

So 15 different ways in which at least 1 letter is put in the right envelope, so 24 - 15 = 9 ways in which ZERO letters are in the right envelope

If 3 letter are correct, the fourth one has no other option but to go into the right one. So, the no.of cases where only 3 letters are correct is 0

If 1 letter is correct, then remaining 3 letters may be put in 2 incorrect ways: Correct places: ABCD Number of options in which only A is correctly placed - 2.

ADBC, ACDB.

So there are 2*4=8 options if 1 letter is correct.

Does it make sense?

Posted from my mobile device

gmatclubot

Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
10 Dec 2019, 06:27