Let denote the number of subsets of that contain more prime numbers than multiples of 4. Compute the largest integer such that divides .
Solution
Let denote a subset with the said property. Note that there are 25 multiples of 4 and 25 primes in the set , with no overlap between the two. Let denote the subset of 50 numbers that are neither prime nor a multiple of 4, and let denote the 50 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 4 than primes, then contains more primes than multiples of 4, and conversely. Furthermore, contains an equal number of primes and multiples of 4 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 50 ! is divisible by 2 exactly times while 25 ! is divisible by 2 exactly times, it follows that is divisible by 2 exactly 3 times, so the answer is .