3
I have an old Olympiad question on informatics. There are 31 boxes. In each box there is one number. We know the number if and only if we open the box. We want to calculate the minimum number of boxes that must be opened to find one number that is not lower than the numbers of its neighbor boxes...