Apr 21 10:00 PM PDT  11:00 PM PDT $84 + an extra $10 off for the first month of EMPOWERgmat access. Train to be ready for Round 3 Deadlines with EMPOWERgmat's Score Booster. Ends April 21st Code: GCENHANCED Apr 22 08:00 AM PDT  09:00 AM PDT What people who reach the high 700's do differently? We're going to share insights, tips, and strategies from data we collected on over 50,000 students who used examPAL. Save your spot today! Apr 21 07:00 AM PDT  09:00 AM PDT Get personalized insights on how to achieve your Target Quant Score. Apr 23 08:00 PM EDT  09:00 PM EDT Strategies and techniques for approaching featured GMAT topics. Tuesday, April 23rd at 8 pm ET Apr 24 08:00 AM PDT  09:00 AM PDT Join the Live Chat April 24th at 8 am PT. Learn the best strategies for acing the Verbal section. From Sentence Correction tactics to 3 keys for solving Reading Comprehension questions and tips for Critical Reasoning questions. Apr 24 08:00 PM EDT  09:00 PM EDT Maximize Your Potential: 5 Steps to Getting Your Dream MBA Part 3 of 5: Key TestTaking Strategies for GMAT. Wednesday, April 24th at 8 pm ET Apr 25 10:00 PM PDT  11:00 PM PDT Join an exclusive workshop for GMAT Club members and learn how to cut your preparation time by 50% and still reach a 700+ on the GMAT. Limited for the first 99 registrants. Register today! Apr 27 07:00 AM PDT  09:00 AM PDT Attend this webinar and master GMAT SC in 10 days by learning how meaning and logic can help you tackle 700+ level SC questions with ease. Apr 27 10:00 PM PDT  11:00 PM PDT Learn the best strategies for acing the Verbal section. From Sentence Correction tactics to 3 keys for solving Reading Comprehension questions and tips for Critical Reasoning questions. Video Premiere April 23rd at 8am PT Apr 28 07:00 AM PDT  09:00 AM PDT Attend this webinar to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes.
Author 
Message 
TAGS:

Hide Tags

Manager
Status: Gathering chakra
Joined: 05 Feb 2018
Posts: 188

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
Show Tags
11 Mar 2019, 13:57
Question Stats:
27% (02:07) correct 73% (02:11) wrong based on 33 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.
The correct answer is choice B.
Official Answer and Stats are available only to registered users. Register/ Login.



CEO
Joined: 12 Sep 2015
Posts: 3587
Location: Canada

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
Show Tags
11 Mar 2019, 17:52
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 DONE! There are 9 such outcomes. Answer: B ASIDE: Here's a similar question to practice with: https://gmatclub.com/forum/tanyaprepar ... 85167.html Cheers, Brent
_________________
Test confidently with gmatprepnow.com



Manager
Status: Gathering chakra
Joined: 05 Feb 2018
Posts: 188

A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
Show Tags
12 Mar 2019, 06:53
GMATPrepNow is this correct reasoning? 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.



Senior Manager
Joined: 24 Oct 2016
Posts: 375
GMAT 1: 670 Q46 V36 GMAT 2: 690 Q47 V38

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. From Karishma's blog: https://www.veritasprep.com//blog/2011/ ... envelopes/. 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.
_________________
Most Comprehensive Article on How to Score a 700+ on the GMAT (NEW) Verb Tenses Simplified If you found my post useful, KUDOS are much appreciated. Giving Kudos is a great way to thank and motivate contributors, without costing you anything.



Intern
Joined: 06 Feb 2019
Posts: 5

Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
Show Tags
17 Mar 2019, 20:17
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.
4 letters correct = 4C4 = 1 3 letters correct = 4C3 = 4 2 letters correct = 4C2 = 6 1 letter correct = 4C1 = 4
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




Re: A secretary types 4 letters and then addresses the 4 corresponding
[#permalink]
17 Mar 2019, 20:17






