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.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 1912:30 PM EST
-01:30 PM EST
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
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
11 May 2018, 01:09
Kudos
Bookmarks
D
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:
23% (03:03) correct
77%
(03:10)
wrong
based on 571
sessions
History
Date
Time
Result
Not Attempted Yet
In a hostel there are 250 students, 120 watch Fox News, 80 watch Sky Sports, and 90 watch ABC. 50 students watch both Fox News and Sky Sports, 60 students watch both Sky sports and ABC and 65 students watch both Fox News and ABC. What is the minimum number of students who watch at least one of the given channels?
A. 35
B. 50
C. 135
D. 150
E. 165
A. 35
B. 50
C. 135
D. 150
E. 165
12 May 2018, 05:25
Kudos
Bookmarks
One formula for 3 overlapping sets is as follows:
Total = Group 1 + Group 2 + Group 3 - (at least 2 of the groups) + (all 3 groups) + none.
In the problem above:
Total = 250.
Group 1 = 120.
Group 2 = 80.
Group 3 = 90.
(at least 2 of the groups) = 50+60+65 = 175.
Let x = all 3.
Let N = none.
Plugging these values into the equation above, we get:
250 = 120 + 80 + 90 - 175 + x + N.
250 = 115 + x + N
N = 250 - 115 - x.
N = 135 - x.
To MINIMIZE the number who watch at least 1 channel, we must MAXIMIZE the value of N: the number who watch NONE of the channels.
In the equation above, the value of N will be maximized if x (all 3) is as small as possible.
Of the given overlaps -- 50, 60, 65 -- the two greatest overlaps both include A:
(at least S and A) + (at least F and A) = 60+65 = 125.
Now this value ((at least S and A) + (at least F and A)) is 35 greater than the total number who watch A (90).
Implication:
At least 35 students must watch all 3 channels.
Thus, the minimum value of x = 35.
Plugging x=35 into N = 135 - x, we get:
N = 135 - 35 = 100.
Since the maximum number who watch none of the channels = 100, the minimum number who watch at least 1 channel = 250-100 = 150.
Total = Group 1 + Group 2 + Group 3 - (at least 2 of the groups) + (all 3 groups) + none.
In the problem above:
Total = 250.
Group 1 = 120.
Group 2 = 80.
Group 3 = 90.
(at least 2 of the groups) = 50+60+65 = 175.
Let x = all 3.
Let N = none.
Plugging these values into the equation above, we get:
250 = 120 + 80 + 90 - 175 + x + N.
250 = 115 + x + N
N = 250 - 115 - x.
N = 135 - x.
To MINIMIZE the number who watch at least 1 channel, we must MAXIMIZE the value of N: the number who watch NONE of the channels.
In the equation above, the value of N will be maximized if x (all 3) is as small as possible.
Of the given overlaps -- 50, 60, 65 -- the two greatest overlaps both include A:
(at least S and A) + (at least F and A) = 60+65 = 125.
Now this value ((at least S and A) + (at least F and A)) is 35 greater than the total number who watch A (90).
Implication:
At least 35 students must watch all 3 channels.
Thus, the minimum value of x = 35.
Plugging x=35 into N = 135 - x, we get:
N = 135 - 35 = 100.
Since the maximum number who watch none of the channels = 100, the minimum number who watch at least 1 channel = 250-100 = 150.
Krotishka1
14 May 2018, 16:42
Kudos
Bookmarks
gmatbusters
To minimize the number of students who watch at least one channel, we want to maximize the number of the students who watch none of these channels.
We can create the equation:
250 = 120 + 80 + 90 - (50 + 60 + 65) + triple + none
250 = 290 - 175 + t + n
250 = 115 + t + n
135 - t = n
Since we want to maximize the value of n, we need to minimize the value of t. Let’s let a = the number of students who watch ABC only. Recall that t is the number of students who watch all 3 channels. Thus we have 65 - t students watching ABC and Fox (but not Sky) and 60 - t students watching ABC and Sky (but not Fox) and we can create the equation for all the students who watch ABC:
(65 - t) + (60 - t) + t + a = 90
125 - t + a = 90
35 = t - a
Since we want to minimize the value of t, so a must be 0. Thus t = 35
Therefore, n = 135 - t = 135 - 35 = 100.
Since there could be a maximum 100 students who watch none of the 3 channels, there must be a minimum of 250 - 100 = 150 who watch at least one channel.
Answer: D
