Each student comes from one of the \(50\) states.
We take the least case where we consider to have \(99\) students from each state.
So there are \(99 \times 50 = 4950\) students in the university.
The next final student is the one from any of these \(50\) states so that he is the \({100^{{\rm{th }}}}\) student from that specific state.
Thus, if \(4950 + 1 = 4951\) students are considered, such that there is at least one student from each state, then there is at least one state from which \(100\) students might have come.