BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Put on Your Problem Solving Hat III

Expert replies
by dtweah » Tue May 12, 2009 6:19 am
There are 2005 people at a party. By the end of the party, in every group of four people there is
at least one person who has shaken hands with the other three members of the group. What is
the smallest possible number of people who have shaken hands with everyone at the party?

a. 1002
b. 1003
c. 2001
d. 2002
e. 2003
Join the discussion
Source: — Problem Solving |

by avenus » Wed May 13, 2009 4:31 pm
Suppose all but 4 people have shaken hands with everyone. If we take the remaining 4 and form a group, that group will not meet the requirement (they will have shaken hands with many out of the group but none of them will have shaken hands with the other 3 within the group). This tells us n>2001.

Now assume 1 of those socially impaired people, following the advice of his $200-an-hour shrink, decides to go wild and shakes hands with everyone at the party. We now have someone that's shaken hands with the other 3 and the group of outcasts is no longer such. n = 2002

Answer is D
Last edited by avenus on Thu May 14, 2009 7:46 am, edited 1 time in total.
Join the discussion

by dtweah » Wed May 13, 2009 4:47 pm
avenus wrote:Suppose all but 4 people have shaken hands with everyone. If we take the remaining 4 and form a group, that group will not meet the requirement (they will have shaken hands with many out of that group people but none of them will have shaken hands with the other 3 within the group). This tells us n>2001.

Now assume 1 of those socially impaired people, following the advice of his $200-an-hour shrink, decides to go wild and shakes hands with everyone at the party. We now have someone that's shaken hands with the other 3 and the group of outcasts is no longer such. n = 2002

Answer is D
Brilliant. I will post the OA which to me is not too informative. I reasoned it out this way.

2005/4= 501 remainder 1. The problem says every gruop of 4 must have 1 person who has shaken hands with the rest in the group. There are 501 such groups of four. Which means any random scatterring and reassignment must meet that condition. Suppose that 2000 people are the min. Then the rest 5 people will have nobody who has shaken hands with the rest in the group . But this contradicts the conditin of the problem so it cannot be true that 2000 is the min. What about 2001? There will still be 4 people who can form a group that contradicts the hypothesis. 2002? Yes b/c the problem does not require a group of 3 only a group of 4.
Join the discussion