- #1
kliker
- 104
- 0
show that in a set that has n people at least 2 of them have the same amount of acquaintances in the set
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 don't think its right, maybe someone could guide me please, i would appreciate it
i really think that i haven't fully understood how to use this principle here
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 don't think its right, maybe someone could guide me please, i would appreciate it
i really think that i haven't fully understood how to use this principle here