its discrete math question.
there are 51 students in the student assembly. the assembly needs to be divided into n committees that each student is on exactly one committee. each student hates exactly three other students. (if student a hates student b, then student b does not necessarily hate student a.)find the smallest n such that it is always possible to arrange the committees so that no student hates another student on his or her committee.