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:
From 535→695 to 735 in one shot — GMATWhiz students prove what focused prep can achieve. Get up to 44% OFF on expert-guided, AI-driven GMAT prep with mentor support. Plans from $149.
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Assume Letter A goes to envelope a.
For envelope B, we can only place letter C or D --> 2 ways (assume letter C goes to envelope b)
For envelope C, we can only place letter D --> 1 way
For envelope D, we place the last letter, letter B --> 1 way
# of ways --> 2
There are also cases for letter B to envelope b, letter C to envelope c, and letter D to envelope d. Total # of winning solutions = 8
Assume Letter A goes to envelope a. For envelope B, we can only place letter C or D --> 2 ways (assume letter C goes to envelope b) For envelope C, we can only place letter D --> 1 way For envelope D, we place the last letter, letter B --> 1 way
# of ways --> 2
There are also cases for letter B to envelope b, letter C to envelope c, and letter D to envelope d. Total # of winning solutions = 8
A ----- > B,C,D ----- > 3 B ---- > C, D ---- > 2 C ---- > D ---- > 1
So I'm getting 6 that won't match....
Show more
A-----> a-----------> 1 way
B-----> c,d---------> 2 ways (letter B can`t go to a or b)
C-----> d-----------> 1 way (letter C can`t go to a or c or b, if letter C goes to b then only envelop d would be left for letter D-not winning case)
D-----> b-----------> 1 way (one envelop is left)
for each letter in correct envelop there are 1*2*1*1 ways to organize the rest letters and envelops, so that none matches.
4*2=8
can it be solved by formulas, without listing...?
while listing i made mistake, i thought C can go to either d or b envelop, and got 4*4=16 # winning case.. got stuck there
OA is D
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.