Determine the number of sets of positive integers with , for which the set
is a subset of .
Determine the number of sets of positive integers with , for which the set
is a subset of .
We prove that there are such sets. In particular, we prove that the sets that satisfy the conditions are of the form , with a subset of and . Call sets of this form "nice". Since there are subsets of , there are nice sets. We first show that every nice set satisfies the conditions. Suppose that with . Then , so . There thus exists a with such that . Since , it also holds that , so and . This means and that is an element of . Therefore, every element of is an element of , which implies that satisfies the conditions.
We now show that every set that satisfies the conditions is nice. Suppose first that there exists a with such that . Then for some with , so is an element of and must therefore also be an element of . However, , a contradiction. Therefore, such an cannot occur. This means that can be written as the disjoint union , with and . Let be the number of elements of . Then , because has at most 14 elements. To prove that is nice, we need to prove that . It is sufficient to prove that , the largest element of , is equal to . Therefore, assume for the sake of contradiction that . For with it then holds that , so . Therefore, and thus 2000. Since , it follows that , but then is a larger element of than , the maximal element. Contradiction. Therefore, , which implies that . Thus, is nice.