given 365 cards, in which distinct numbers are written
Source: ARO 2005 - problem 9.4
April 30, 2005
inductionceiling functionsearchcombinatorics unsolvedcombinatorics
Problem Statement
Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?