universal condition
6 countries
total representatives
75
1) one of the country sent 41
so remaining countries can send 34 remaining candidate in many may
let the five candidate have a-2,a-1,a,a+1,a+2
sum of this should be equal to 34
5a=34 a=6.8
taking approx values
5,4,7,8,10
ohter values can be 5,3,7,8,11
or 5,2,7,8,12
or 5,1,7,8,13
2)A should be less than 12
so if we take only this condition remaining 5 can also take many values so many solution
now combining 1 and 2
one country=41
a=11
again can take many values as seen in the above two condiitoin
one comndition where a would be less than 10
will be 41,6,4,7,8,9 a=9 second largest but not atleast 10 less than 10
so answer choice is E
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
Six countries
Source: Beat The GMAT — Data Sufficiency |
Amising:amising6 wrote:universal condition
6 countries
total representatives
75
1) one of the country sent 41
so remaining countries can send 34 remaining candidate in many may
let the five candidate have a-2,a-1,a,a+1,a+2
Why do you assume that the numbers are consecutives? why a-2,a-1,a,a+1,a+2? this could be 20, 2, 3, 7, ...
Silvia
let us try and see the max and min number that A can send,
for 1) it is obvious that A cannot send 41 because then he wil be the highest, but we know he is 2nd highest.
So A is one of the countries which send a total of 34 reps
the max A can be 24 with B C D & E having sent 1 2 3 & 4
min A can be 9 with B C D & E sending 8 7 6 & 4 {beacause he has to be highest among the 5}
so, 9<=A<=24, which doesnt prove whether A is at least 10 or not...
similarly for 2)
A ha fewer than 12 reps so it can be anything =>5 {considering the other 4 countries having sent minimum i.e. 1 2 3 & 4}
so, 5<=A<=11, which doesnt prove whether A is at least 10 or not...
now evn if we combine both,
9<=A<=11
which again doesnt prove whether A is at least 10 or not...
so the correct option is E
for 1) it is obvious that A cannot send 41 because then he wil be the highest, but we know he is 2nd highest.
So A is one of the countries which send a total of 34 reps
the max A can be 24 with B C D & E having sent 1 2 3 & 4
min A can be 9 with B C D & E sending 8 7 6 & 4 {beacause he has to be highest among the 5}
so, 9<=A<=24, which doesnt prove whether A is at least 10 or not...
similarly for 2)
A ha fewer than 12 reps so it can be anything =>5 {considering the other 4 countries having sent minimum i.e. 1 2 3 & 4}
so, 5<=A<=11, which doesnt prove whether A is at least 10 or not...
now evn if we combine both,
9<=A<=11
which again doesnt prove whether A is at least 10 or not...
so the correct option is E
-
Patrick_GMATFix
- GMAT Instructor
- Posts: 1052
- Thanked: 335 times
This is also discussed at https://www.beatthegmat.com/p-c-t61738.html
This type of question can often be solved by doing your best to prove that you can get two different answers from each statement. If you can get 2 answers using values that agree with he statement as well as the prompt (the question stem), you will have proven that the statements are not sufficient.
The same technique can be used to evaluate the statements together. In this case, be sure to use values that agree with the prompt as well as with both statements. To save time, see whether the values you've used to check previous statements can be used again.
The answer is E. A detailed solution and step-by-step video solution are available at GMATPrep Question 1097.
Good luck,
-Patrick
This type of question can often be solved by doing your best to prove that you can get two different answers from each statement. If you can get 2 answers using values that agree with he statement as well as the prompt (the question stem), you will have proven that the statements are not sufficient.
The same technique can be used to evaluate the statements together. In this case, be sure to use values that agree with the prompt as well as with both statements. To save time, see whether the values you've used to check previous statements can be used again.
The answer is E. A detailed solution and step-by-step video solution are available at GMATPrep Question 1097.
Good luck,
-Patrick
- Check out my site: GMATFix.com
- To prep my students I use this tool >> (screenshots, video)
- Ask me about tutoring.
option 1
one country sent =41
remaining delgates=34
A can send 10 and other countries can send 9,8,5,3
A can send 9 and other countries can send 8,7,4,6
not suff
option 2
A can send 9,10,11 etc and other countris delegates can accordingly adjusted
not suff
1 and 2
not suff
one country sent =41
remaining delgates=34
A can send 10 and other countries can send 9,8,5,3
A can send 9 and other countries can send 8,7,4,6
not suff
option 2
A can send 9,10,11 etc and other countris delegates can accordingly adjusted
not suff
1 and 2
not suff
-------------------------------------
--------------------------------------
General blog
https://amarnaik.wordpress.com
MBA blog
https://amarrnaik.blocked/
--------------------------------------
General blog
https://amarnaik.wordpress.com
MBA blog
https://amarrnaik.blocked/
