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 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 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.
31 Mar 2019, 21:07
Kudos
Bookmarks
B
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:
17% (02:33) correct
83%
(02:23)
wrong
based on 255
sessions
History
Date
Time
Result
Not Attempted Yet
Let a, b, c, d, and e be positive integers with a + b + c + d + e = 2010 and let M be the largest of the sum a + b, b + c, c + d and d + e. What is the smallest possible value of M?
A. 670
B. 671
C. 802
D. 803
E. 804
A. 670
B. 671
C. 802
D. 803
E. 804
21 Apr 2019, 21:54
Kudos
Bookmarks
To make the largest sum as small as possible, we'll want to make all of the sums equal (or as close to equal as we're allowed to make them), because if, say, d+e were the largest sum, and if it were larger than b+c, we'd be able to reduce d or e, and increase b or c by a corresponding amount, and thereby make d+e, the largest sum, smaller. So we wouldn't have found the smallest possible largest sum in this case.
And if all of the sums are equal, so a+b = b+c, b+c = c+d and so on, we find that a=c=e and b=d. If we permit zero, we'd find this arrangement makes M smallest:
670, 0, 670, 0, 670
but since zero is not allowed (the letters must be positive integers), the answer will be 671, which we can get with an arrangement like this:
669, 2, 668, 2, 669
And if all of the sums are equal, so a+b = b+c, b+c = c+d and so on, we find that a=c=e and b=d. If we permit zero, we'd find this arrangement makes M smallest:
670, 0, 670, 0, 670
but since zero is not allowed (the letters must be positive integers), the answer will be 671, which we can get with an arrangement like this:
669, 2, 668, 2, 669
General Discussion
