I am stuck on this question involving the pigeon hole principle. Any help is appreciated.
In a gathering of 30 people, there are 104 different pairs of people who know each other.
a. Show that some person must have at least seven acquaintances.
b. Show that some person must have fewer than seven acquaintances.
I think this one uses the ceiling function, but I am confused.