Let n be a positive integer. Prove that at least 2n−1+n numbers can be chosen from the set {1,2,3,…,2n} such that for any two different chosen numbers x and y, x+y is not a divisor of x⋅y. number theory proposednumber theoryCombinatorial Number Theory