Events & Promotions
|
|
GMAT Club Daily Prep
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
May 1212:00 PM EDT
-11:59 PM EDT
Make the most of your break with the most realistic GMAT™ prep. Take up to $700 off select products.
May 1308:30 AM PDT
-09:30 AM PDT
In Episode 4 of our GMAT Ninja CR series, we tackle the most intimidating CR question type: Boldface & "Legalese" questions. If you've ever stared at an answer choice that reads, "The first is a consideration introduced to counter a position that...- May 14
08:30 AM PDT
-09:30 AM PDT
Most GMAT test-takers are intimidated by the hardest GMAT Verbal questions. In this session, Target Test Prep GMAT instructor Erika Tyler-John, a 100th percentile GMAT scorer, will show you how top scorers break down challenging Verbal questions..
05 Aug 2025, 05:28
Kudos
Bookmarks
scheol79
For Questions with small values like these and multiple conditions, I'd rather list down the cases than use permutations/combinations to avoid any mistakes.
This is how i'd exactly solve :
So here,
n=3
Total = 5
Jane(a), Joan(b), Paul(c), Stuart(d), and Jessica(e)
Paul(c) & Stuart(d) can't be together.
Jane(a) iff Paul(c)
Possibilities with a : {a,c,b} , {a,c,e} = 2
Possibilities with b except a : {b,c,e} , {b,d,e} = 2
Possibilities with c except a,b : -
rest all -
Thus ans is 4.
11 Apr 2026, 23:19
Kudos
Bookmarks
Most effiicient way to solve is to write down all their names down and simply draw arrows with whom they can pair. Also make a distinction [according to ur convenience] of the pair that can't be formed.
Form teams without Jessica first and then with Jessica as she has added restrictions. This way one will not overlap cases is at all.
Without Jessica:
Paul and Stuart each getting into 1 team each with the other two Js.
2 teams.
With Jessica:
Has to go with Paul with only two options either Jane or Joan again as Paul can't go with Stuart.
2 teams.
Total = 4
Answer: Option B
Form teams without Jessica first and then with Jessica as she has added restrictions. This way one will not overlap cases is at all.
Without Jessica:
Paul and Stuart each getting into 1 team each with the other two Js.
2 teams.
With Jessica:
Has to go with Paul with only two options either Jane or Joan again as Paul can't go with Stuart.
2 teams.
Total = 4
Answer: Option B
Bunuel
12 Apr 2026, 02:31
Kudos
Bookmarks
A committee of three students has to be formed from five candidates: Jane, Joan, Paul, Stuart, and Jessica. If Paul and Stuart refuse to be on the committee together, and Jane refuses to be on the committee without Paul, how many committees can be formed?
Paul -------> x Stuart
Stuart -----> x Paul
x Paul -----> x Jane or Jane ------> Paul
Committee 1: Jane, Paul, Joan
Committee 2: Jane, Paul, Jessica
Committee 3: Paul, Joan, Jessica
Committee 4: Stuart, Joan, Jessica
IMO B
Paul -------> x Stuart
Stuart -----> x Paul
x Paul -----> x Jane or Jane ------> Paul
Committee 1: Jane, Paul, Joan
Committee 2: Jane, Paul, Jessica
Committee 3: Paul, Joan, Jessica
Committee 4: Stuart, Joan, Jessica
IMO B
