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 - The Fusion of Science and Community**

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

# Pigeonhole Principle

Loading...

Similar Threads - Pigeonhole Principle | Date |
---|---|

I Church-Turing-Deutsch principle and Incompleteness-Halting. | Nov 28, 2016 |

Inclusion-Exclusion principle problem | Sep 15, 2015 |

Graph Theory and Pigeonhole Principle | Nov 6, 2011 |

A pigeonhole problem | Jun 12, 2007 |

Concept of the pigeonhole principle | Aug 7, 2005 |

**Physics Forums - The Fusion of Science and Community**