Maximum such k
Source: Azerbaijan IMO TST 2016, D3 P3
May 26, 2018
combinatorics
Problem Statement
During a day customers visited the store. Every customer has been only once at the store(a customer enters the store,spends some time, and leaves the store). Find the greatest integer that makes the following statement always true.We can find customers such that either all of them have been at the store at the same time, or any two of them have not been at the same store at the same time.