Denote . Find the maximum number of elements of a subset of which contains only perfect squares pairwise relatively prime.
Solution
If and , then , that is . The largest subset of whose elements are perfect squares is
We must choose among them the maximum number of pairwise prime numbers. Consider the partition of into the sets , , , , , . If we choose 7 or more elements of , then two of them are in the same , so they are not co-prime. So we cannot take more than 6 elements; an example is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.