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.
Sep 2312:30 AM EDT
-01:30 AM EDT
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more
Sep 2401:30 AM EDT
-01:30 AM EDT
Tejas studied hard but kept repeating the same mistakes. After 3 attempts at 645, a focused 4-week strategy helped him identify and fix what was holding him back—leading to a 695 with just 12–15 hours of study per week.
Sep 2601:00 PM EDT
-04:00 PM EDT
Top scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included. Class starts Saturdays Sept. 26, 2026 - Dec. 19, 2026, 1:00pm-4:00pm ES
Sep 2606:00 PM PDT
-07:00 PM PDT
Free- full-length test + 15 concept videos + 150+ short videos + study plan!
Sep 2911:00 AM EDT
-01:00 PM EDT
" Description: Top scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thur Sept. 29, 2026 - Dec. 3, 2026, 11:00am-1:00pm EST
Oct 0107:00 AM BST
-08:00 AM GMT
Welcome to the GMAT Club's Free Interview Prep Event for Top MBA Programs! Buy tickets - Virtual series that’s all set to equip you to -excel in your MBA interviews.
07 Jul 2025, 08:00
Kudos
Bookmarks
No married couples: \(2^n\)
Only married couples: \(\frac{n!}{(\frac{n}{2}!)^2}\)
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
50% (02:16) correct
50%
(02:45)
wrong
based on 420
sessions
History
Date
Time
Result
Not Attempted Yet
|
A certain company is forming a committee of n people to be chosen from n married couples, where n is a two-digit even number.
Select for No married couples the number of different committees that can be formed if no two people who are married to each other are allowed to serve on the committee, and select for Only married couples the number of different committees that can be formed if the committee must consist only of married couples. Make only two selections, one in each column.
| No married couples | Only married couples | |
| \(n!\) | ||
| \(n^2\) | ||
| \(2^n\) | ||
| \(\frac{n!}{2(n-2)!}\) | ||
| \(\frac{n!}{(\frac{n}{2}!)^2}\) | ||
| \(\frac{(2n)!}{(n!)^2}\) |
ShowHide Answer
Official Answer
No married couples: \(2^n\)
Only married couples: \(\frac{n!}{(\frac{n}{2}!)^2}\)
07 Jul 2025, 08:00
Kudos
Bookmarks
Bunuel
GMAT Club Official Explanation:
Since the committee must not include any married couples, only one "representative" from each married couple can be selected. We are forming an n-person committee, so we must select n married couples that will each send one "representative" to the committee. The number of ways to choose n couples out of n is C(n, n) = 1.
For each of these n couples, there are two choices for the "representative": either husband or wife. This results in 2 * 2 * ... * 2 (n times) = 2^n possibilities.
Therefore, the total number of ways to form the committee is C(n, n) * 2^n = 2^n.
As for the committees that can be formed if the committee must consist only of married couples, we are choosing n/2 couples (which gives us n people) from n married couples. This is given by:
\(C(n, \frac{n}{2}) =\)
\(= \frac{n!}{\frac{n}{2}! * (n - \frac{ n}{2})!} =\)
\(= \frac{n!}{(\frac{n}{2}!)^2}\)
General Discussion
07 Jul 2025, 08:35
Kudos
Bookmarks
Hi,
Given: Couples = n => Total People = 2n
Need to select = n (half)
No married couples: We need to select one from each couple
So 2 ways to select from each couple = 2 * 2 * 2 * ...... n times = 2^n
Only married couples: We need to select n/2 couples so that we get total n people
those n/2 couples will come from n couples in total = nC(n/2) = n!/(n/2!)(n-n/2)! = n!/(n/2!)^2
Cheers,
Keshav Sharma
Given: Couples = n => Total People = 2n
Need to select = n (half)
No married couples: We need to select one from each couple
So 2 ways to select from each couple = 2 * 2 * 2 * ...... n times = 2^n
Only married couples: We need to select n/2 couples so that we get total n people
those n/2 couples will come from n couples in total = nC(n/2) = n!/(n/2!)(n-n/2)! = n!/(n/2!)^2
Cheers,
Keshav Sharma
