Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (goformit100):

If there are 48 different pairs of people, who know each other at the party of 20 people, then show that some person has 4 or fewer acquaintances.

OpenStudy (goformit100):

@satellite73

OpenStudy (anonymous):

must be pigeonhole week

OpenStudy (goformit100):

Ok but how ?

OpenStudy (anonymous):

idk

OpenStudy (goformit100):

Will I get explanation on OS ?

OpenStudy (anonymous):

well i think it has to do with graphs maybe does that ring a bell?

OpenStudy (anonymous):

you will assume that each person has 5 or more acquaintances, then arrive at a contradiction say make a graph , people are connected if they know each other the each person has 5 or more connections, so the sum of all these will be at least 100

OpenStudy (anonymous):

does this sound familiar at all? there is going to be some reason that if the number of edges in the graph will be half of that, namely 50, but since there are only 48 people that is a contradiction

OpenStudy (goformit100):

Thank you @satellite73

OpenStudy (anonymous):

yw, not really complete, but i hope you get the idea

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!