Let . Then the number of elements in the set and the sum of all the elements of is not a multiple of 3 is _________.
We have the set containing seven elements. For every subset we are interested in the remainder obtained when the sum of its elements is divided by 3. Because divisibility by 3 depends only on the remainder, it is natural to classify each element of according to its remainder (or “residue”) modulo 3.
Computing the residues, we obtain
So the seven elements fall into three residue classes:
Choosing elements from the “0‐class” never alters the remainder, because each of those numbers is itself a multiple of 3. Hence any subset chosen from contributes (mod 3) to the total sum. There are possible selections from this class, including the empty selection.
If we pick elements from the “1‐class”, each contributes a remainder , so their combined remainder is
Because , the value may be or , and the corresponding numbers of ways are
Similarly, choosing elements from the “2‐class” gives a combined remainder
and with the admissible values and counts are also
For the total sum of a subset to be a multiple of 3 we require
We now list every pair satisfying this condition together with the number of ways it can occur.
1. gives residue . We need , which is true only for . Number of ways:
2. gives residue . We need Number of ways:
3. gives residue . We need Number of ways:
Adding these counts, the total number of ways to choose elements from the “1‐class” and “2‐class” so that the running sum is divisible by 3 is
For every such choice we may freely choose any subset of the three “0‐class” elements, and there are possibilities for that. Multiplying, the number of all subsets (including the empty one) whose element-sum is a multiple of 3 equals
Among these subsets, one is the empty set itself. Because the problem specifically excludes the empty set (it demands ), the count of non-empty subsets with sum divisible by 3 is
The total number of non-empty subsets of a 7-element set is
Therefore the number of non-empty subsets whose element-sum is not a multiple of 3 is obtained by simple subtraction:
Hence, the correct answer is Option C ().
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.