Question 7
Prove that it is possible to pick 20 numbers among $1, 2, \ldots, 10000$ such that the members of any non-empty subset of these 20 numbers has a sum which is not an $n$-th power of some number (for any $n \gt 1$).
Math Olympiad Vault · MathNet 2023-part-06 — 191 problems (EN–VI)