Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am struggling with a question that involves splitting 50 people into a max of 6 groups and then splitting the same 50 people into a max of 8 groups, while having completely different groups in the second split; i.e., if $a,b$ were together in the first split they can't be together in the second split.

I need to prove that this is an impossible requirement to fulfill. I know it has to do with having more pairs then possibilities but I can't seem to manage to prove this.

Cans anyone please help?


share|cite|improve this question
up vote 5 down vote accepted

If $50$ people are split into $8$ groups, how many members must the largest group at least have? Can the members of that largest group all have been in different groups in the first split?

share|cite|improve this answer
Ah so simple - Thanks man :) can't believe I missed that – Jason Oct 9 '11 at 16:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.