Find the minimal positive integer n such that no matter what n distinct numbers from 1 to 1000 you choose, such that no two are divisible by a square of the same prime, one of the chosen numbers is a square of prime.
D. Zmiaikou Inclusion-exclusioncombinatorics