Each of 2n+1 students chooses a finite, nonempty set of consecutive integers . Two students are friends if they have chosen a common number. Everyone student is friends with at least n other students. Show that there is a student who is friends with everyone else. combinatoricsconsecutivenumber theory