kids, any set of kids contains at least one pair of friends. It turns out that in any possible arrangement, the most popular kid will have at least friends. Find .
In a class ofDetails and Assumptions
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The answer is 1 0 0 7 . Suppose the most popular kid has only 1 0 0 6 friends (or less). Then everyone but the most popular kid and his friends must be friends, so these people each have 1 0 0 7 friends, contradiction.