Can you create a subset of (1, 2, 3, ..., 3k) such that none of its 2k-1 members is twice the value of another?

Either provide such a set or show none exists.

Inspired by: Austrian-Polish Math. Competition.

Yes. Let k = 1, then 3k=3,  2k-1=1., so {1} is a solution.

Edited on May 2, 2022, 9:21 am

Posted by broll on 2022-05-02 08:21:47