Prove that in any set of 17 distinct natural numbers one can either find five numbers so that four of them are divisible into the other or five numbers none of which is divisible into any other.(An established theorem) number theorydivisibleDividecombinatorics