show that in a set that has n people at least 2 of them have the same amount of acquaintances in the set(adsbygoogle = window.adsbygoogle || []).push({});

well what i tried is that first of all if we have n people one person can know n-1 people within the set so having a set of n people at least 2 of them should have the same amount of acquaintances in the set

but, i dont think its right, maybe someone could guide me please, i would appreciate it

i really think that i havent fully understood how to use this principle here

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Pigeonhole Principle

**Physics Forums | Science Articles, Homework Help, Discussion**