The number of subsets S of X = {1, 2, 3, 4, ..., 10} with the property : There exis...

Check the final answer first, then review the worked steps.

Answer

5

Work

Total subsets = $2^{10} = 1024$. Subsets without the property are those where no $b \notin S$ exists between $a, c \in S$. These are sets of the form $\{1, \dots, k\} \cup \{m, \dots, 10\}$ with $k < m-1$. The number of such sets is $n+1 = 11$. $\mu = 1024 - 11 = 1013$. Sum $= 1+0+1+3 = 5$.

Step-by-step solution

A subset $S$ fails the property if it contains no $a < b < c$ with $a, c \in S$ and $b \notin S$. This means $S$ must be a union of consecutive integers, i.e., $S = \{1, 2, \dots, k\} \cup \{m, m+1, \dots, 10\}$ or similar. The number of such subsets is $2^{n+1} - (n+1) - 1$ for $n=10$, which is $2^{11} - 12 = 2036$. Total subsets are $2^{10} = 1024$. The property holds for $1024 - 2036$ is wrong; the condition is equivalent to $S$ not being a block. The number of subsets with the property is $2^n - (n+1) = 1024 - 11 = 1013$. Sum of digits of $1013$ is $1+0+1+3 = 5$.