2: Of the 2000 numbers in the field 2000≥n≥1 someone chose 1001 different numbers...
Help Combinatorics
Hello need help while asking
Of the 2000 numbers in the field 2000≥n≥1 someone chose 1001 different numbers.
Prove that the 1001 groups that are selected must have two different elements x, y so that y is divisible by x with no remainder.
thanks.
Help Combinatorics
Hello need help while asking
Of the 2000 numbers in the field 2000≥n≥1 someone chose 1001 different numbers.
Prove that the 1001 groups that are selected must have two different elements x, y so that y is divisible by x with no remainder.
thanks.