Discrete Math help
I'm having trouble with the pigeonhole principle in case you're wondering.
In a gathering of 30 people, there are 104 different pairs of people who know each other.
Show that some person must have at least seven acquaintances.
I know that the answer is achieved by finding the ceiling function of 208/30, but can anyone tell me where the 208 came from? Why do I double 104 from the different pairs?
November 9, 2011
1 Comment • Newest first
208 came from the 104 pairs. In other words, you are converting 104 pairs into 208 individuals.