Problem #PRU-78496

Problems Methods Examples and counterexamples. Constructive proofs Pigeonhole principle Pigeonhole principle (other)

Problem

What is the largest amount of numbers that can be selected from the set 1, 2, ..., 1963 so that the sum of any two numbers is not divisible by their difference?