Published by:
CGP EDU Academic Team
Published on: August 14, 2026
Let 
. the number of non empty subsets of S that have the sum of all elements a multiple of 3, is _______
Text Solution
Verified by ExpertsThe correct answer is:
43
(43)
Elements of the type 3k=3
Elements of the type 3k+1=1, 7, 9
Elements of the type 3k+2=2,5, 11
Subsets containing one element 
Subsets containing two elements.
Subsets containing three elements.
Subsets containg four elements
Subsets containing five elements
Subsets containing six elements 
Subsets containing seven elements 
sum = 43
──────────────────────────────────────────────────────────────────────────────────────────
Prepare Smarter with CGP Edu
Get practice questions, solutions, and test series in one place.
Write a Review
Share your experience with this question and solution.
Commentary
Send your comment, doubt, correction, or feedback to admin.
Similar Questions
Explore conceptually related problems
The number of integers, greater than 7000 that can be formed, using the digits 3, 5, 7, 8 without r…
The number of numbers, strictly between 5000 and 10000 can be formed using the digits 1, 3,5, 7, 9 …
The number of 3 digit numbers, that are divisible by either 3 or 4 but not divisible by 48, is
The letters of the word OUGHT are written in all possible ways and these words are arranged as in a…
The number of ways of selecting two numbers a and b, such that 2 is the remainder when is divided…
The number of 9 digit numbers, that can be formed using all the digits of the number 123412341 so t…