AMC 10B 2024 (Problem 12)
A group of 100 students from different countries meet at a mathematics competition. Each student speaks the same number of languages, and, for every pair of students and , student speaks some language that student does not speak, and student speaks some language that student does not speak. What is the least possible total number of languages spoken by all the students?
Let be the total number of languages, and let be the sets of languages spoken by students , respectively.
By Sperner's Theorem,For ,For ,We can choose 100 distinct 4-element subsets of a set of 9 languages. These subsets satisfy all the conditions, so 9 languages are sufficient.
(A)