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 Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ 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.

Meeting

Expert replies
by Aman verma » Mon Feb 22, 2010 6:03 am
Q : At a meeting of the Senate there were n people.As per the convention everyone has received some chocolates in the following manner . As A,B,C,D,E ...... etc have received 1,2,3,4,5....etc chocolates respectively.Before anyone has eaten a bit of chocolate, due to some urgent call , the chairman left the meeting with his chocolates . Later on the rest of the attendants collected their chocolates in a box and then redistributed all the chocolates evenly among themselves and thus everyone has received 13 chocolates .Minimum number of person who attended the meeting can be :

a) 15

b) 18

c) 24

d)32

e) 38



Ans [spoiler]c)24[/spoiler]
Last edited by Aman verma on Mon Feb 22, 2010 6:16 am, edited 1 time in total.
Join the discussion
Source: — Problem Solving |

by harsh.champ » Mon Feb 22, 2010 6:12 am
Aman verma wrote:Q : At a meeting of the Senate there were n people.As per the convention everyone has received some chocolates in the following manner . As A,B,C,D,E ...... etc have received 1,2,3,4,5....etc chocolates respectively.Before anyone has eaten a bit of chocolate, due to some urgent call , the chairman left the meeting with his chocolates . Later on the rest of the attendants collected their chocolates in a box and then redistributed all the chocolates evenly among themselves and thus everyone has received 13 chocolates .Minimum number of person who attended the meeting can be :

a) 15

b) 18

c) 24

d)32

e) 38



Ans 24
1+2+3+4+......+n = total no. of chocolates = n(n+1)/2
Now,for minimum no. of persons,the chairman should be the nth person.
Hence,n(n+1)/2 -n =13(n-1)
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P
Join the discussion

by firdaus117 » Mon Feb 22, 2010 6:28 am
harsh.champ wrote:
1+2+3+4+......+n = total no. of chocolates = n(n+1)/2
Now,for minimum no. of persons,the chairman should be the nth person.
Hence,n(n+1)/2 -n =13(n-1)
Hey your solution yields no result.Check it urself.You have wrongly assumed that chairman has to be n th person for minimising 'n'.
I have an easier approach to this question i.e. work through options.
1. 15 sum=120 13*14=182 Rejected
2. 18 Sum=171 13* 17=221 Rejected
3. 24 Sum=300 13*23=299 Accepted
The chairman will have 300-299=1 chocolate. :)Poor man.What's the use being a chairman if u can't have all chocolates.
Join the discussion

by harsh.champ » Mon Feb 22, 2010 6:34 am
firdaus117 wrote:
harsh.champ wrote:
1+2+3+4+......+n = total no. of chocolates = n(n+1)/2
Now,for minimum no. of persons,the chairman should be the 1st person.
Hence,n(n+1)/2 -n =13(n-1)
Hey your solution yields no result.Check it urself.You have wrongly assumed that chairman has to be n th person for minimising 'n'.
I have an easier approach to this question i.e. work through options.
1. 15 sum=120 13*14=182 Rejected
2. 18 Sum=171 13* 17=221 Rejected
3. 24 Sum=300 13*23=299 Accepted
The chairman will have 300-299=1 chocolate. :)Poor man.What's the use being a chairman if u can't have all chocolates.
Hey firdaus,
Thanks .Great approach over here.
Actually,I took the other-way-round .
It should be
the chairman should be the 1st person.
Hence,answer is n(n+1)/2 -1 =13(n-1)
which is 24 C.
I guess now it is correct. :)
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P
Join the discussion

by firdaus117 » Mon Feb 22, 2010 6:40 am
harsh.champ wrote:
firdaus117 wrote:
harsh.champ wrote:
1+2+3+4+......+n = total no. of chocolates = n(n+1)/2
Now,for minimum no. of persons,the chairman should be the 1st person.
Hence,n(n+1)/2 -n =13(n-1)
Hey your solution yields no result.Check it urself.You have wrongly assumed that chairman has to be n th person for minimising 'n'.
I have an easier approach to this question i.e. work through options.
1. 15 sum=120 13*14=182 Rejected
2. 18 Sum=171 13* 17=221 Rejected
3. 24 Sum=300 13*23=299 Accepted
The chairman will have 300-299=1 chocolate. :)Poor man.What's the use being a chairman if u can't have all chocolates.
Hey firdaus,
Thanks .Great approach over here.
Actually,I took the other-way-round .
It should be
the chairman should be the 1st person.
Hence,answer is n(n+1)/2 -1 =13(n-1)
which is 24 C.
I guess now it is correct. :)
Hmm still not correct.How would you know beforehand that he has one chocolate.
However,if you still insist on doing it conventionally,then take an arbitrary value
n(n+1)/2 - k = 13(n-1) with condition k<=n
U will get a quadratic equation of 'n'.Take the condition as for integral 'n',the determinant will be a perfect square. :)
Join the discussion

by Aman verma » Mon Feb 22, 2010 11:23 am
In the above question , maximum how many chocolates were there to be received by all of them,initially :

a)300

b)351

c)450

d)551

e)650

Ans [spoiler]b)351[/spoiler]
Join the discussion

by Aman verma » Tue Feb 23, 2010 3:42 am
Hey folks, I got no solution from anybody on the second part of the question ?
800. Arjun's-Bird-Eye
Join the discussion

by harsh.champ » Tue Feb 23, 2010 4:42 am
Aman verma wrote:Hey folks, I got no solution from anybody on the second part of the question ?
Refer to the 1st post I made:-
subtract n from the sum of n natural no.s
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P
Join the discussion

by firdaus117 » Tue Feb 23, 2010 6:33 am
Aman verma wrote:Hey folks, I got no solution from anybody on the second part of the question ?
Oh,I missed the second question.But probably if you had posted it in a new thread,you would have elicited prompt response.
As it is required to calculate maximum number of chocolates,it would mean that the chairman had 'n' number of chocolates before he left:
So,total chocolates with members earlier were 13(n-1)+n=14n-13
Now work through options,start from highest value(why?)
Option 5.650
14n-13=650
0r,n=673/14 not an integer Rejected
Option 4.551
14n-13=551
or, n=564/14 Rejected
Option 3.450 Rejected on similar logic
Option 2.351
n=26 An integer Accepted :D
Join the discussion