Problem:
Consider the set , . Find the number of the subsets of , such that if the sum of two elements of is a power of then exactly one of them belongs to .
Problem:
Consider the set , . Find the number of the subsets of , such that if the sum of two elements of is a power of then exactly one of them belongs to .
Solution:
1. Let be a subset of having the given property. Since , we have that exactly one of the numbers or belongs to .
If then . We prove by induction that for any integer , , the integers of the form belong to and the integers of the form do not belong to . The statement is true for and suppose it is true for . Since is an odd number there exists such that . Therefore giving . Set and . Then and since is of the form we conclude that and therefore . Analogously .
If then and we prove as above that the integers of the form belong to and the integers of the form do not.
Therefore the odd numbers in are either all integers of the form or all integers of the form .
Let and , where and are odd and and are positive integers. If and , say , then , which is impossible. Therefore and it follows that the sum of the elements from distinct sets is an odd integer is not a power of . For any , after dividing by and applying the above arguments, we obtain that either all integers of the form are in or all integers of the form are in .
Therefore there exist sets with the given property.