Combinatorics question: Prove 2 people at a party know the same amount of people I recently had an assignment and got this question wrong, was wondering what I left out.
Prove that at a party where there are at least two people, there are two people who know the same number of other people there. Be sure to use the variable "n" when writing your answer.
My answer:

n >= 2
  Case1: another person comes to the party, but doesn't know either of the first two. So the original two still only know the same number of people.
  Case2: another person comes, and knows one out of the original 2, so therefore the >newcommer, and the one that doesnt know the newcommer both know the same number of people.
  Case 3: another person comes and knows both of them, implying that they all know each >other, and therefore they all know the same number of people.
So therefore if n>=2, where n and n-1 know each other, in either case whether n+1 joins, >there will be at least two people who know the same amount of people.

Many thanks in advance. Have a test coming up.

First of all, you left out saying that you were proceding by induction, and you left out establishing a base case for the induction. 
But let's look at case 2. Suppose that of the original two people, one knows 17 of the 43 people at the party, the other knows 29. Now the newcomer knows the first of the two, but not the other. What makes you think the newcomer knows exactly 29 of the people at the party?
