Problem:
Let denote the number of subsets of that contain more prime numbers than multiples of . Compute the largest integer such that divides .
Solution
Solution:
Let denote a subset with the said property. Note that there are multiples of and primes in the set , with no overlap between the two. Let denote the subset of numbers that are neither prime nor a multiple of , and let denote the other numbers. Elements of can be arbitrarily included in or excluded by .
Consider and (the set difference is defined to be all elements of that are not in ). and are two disjoint sets such that . If contains more multiples of than primes, then contains more primes than multiples of , and conversely. Furthermore, contains an equal number of primes and multiples of if and only if contains equal numbers as well. Let denote an arbitrary subset of . It follows from examining pairs of sets and that
Since is divisible by exactly times while is divisible by exactly times, it follows that is divisible by exactly times, so the answer is .