Westonci.ca is your go-to source for answers, with a community ready to provide accurate and timely information. Our Q&A platform provides quick and trustworthy answers to your questions from experienced professionals in different areas of expertise. Our platform offers a seamless experience for finding reliable answers from a network of knowledgeable professionals.
Sagot :
The number of distinct subset of the set is an illustration of combination
There are 34 distinct subset of the set that have three digit sums
How to determine the number of distinct subsets?
The set is given as:
S = {1,8,9,39,52,91}
Group the elements
S = {(1,8),9,39,52,91}
So, we have:
S ={s1,s2,s3,s4,s5}
To have a three-digit sum, the sum of the selected elements must be 100 or above.
The number of ways the above set can be selected is:
[tex]n_1 = 4 * [^3C_1 + ^3C_2 + ^3C_3] + 1[/tex]
Evaluate
[tex]n_1 = 4 * [3 + 3 + 1] + 1[/tex]
[tex]n_1 = 29[/tex]
The set can be further rearranged as:
S = {(52,39),9,(8,1)}
i.e.
S = {b1,b2,b3}.
The number of ways the above set can be selected such that the sum is 100 or above is:
[tex]n_2 = 2 * [^2C_1] + 1[/tex]
Evaluate
[tex]n_2 = 2 * 2 + 1[/tex]
[tex]n_2 = 5[/tex]
So, the total number of ways is:
[tex]n = n_1 +n_2[/tex]
This gives
[tex]n = 29 +5[/tex]
[tex]n = 34[/tex]
Hence, there are 34 distinct subset of the see that have three digit sums
Read more about combination at:
https://brainly.com/question/11732255
There are 34 distinct subsets of the see that have three-digit sums.
What are distinct subsets of the set?
When we know that S is a subset of T, we place the circle representing S inside the circle representing T.
The set is given as:
S = {1,8,9,39,52,91}
Group the elements
S = {(1,8),9,39,52,91}
S ={s1,s2,s3,s4,s5}
To have a three-digit sum, the sum of the selected elements must be 100 or above.
The number of ways the above set can be selected is:
[tex]\rm n_1=4\times (^3C_1+^3C_2+^3C_3)+1\\\\n_1=4(3+3+1)+1\\\\n_1=4 \times 7+1\\\\n_1=28+1\\\\n_1=29[/tex]
The set can be further rearranged as:
S = {(52,39),9,(8,1)}
S = {b1,b2,b3}.
The number of ways the above set can be selected such that the sum is 100 or above is:
[tex]\rm n_2=2\times ^2C_1+1\\\\n_2= 2\times 2+1\\\\n_2=4+1\\\\n_2=5[/tex]
The distinct subsets of the set are;
[tex]\rm n_1+n_2=29+5 =34[/tex]
Hence, there are 34 distinct subsets of the see that have three-digit sums.
Read more about combination at:
brainly.com/question/11732255
#SPJ4
We appreciate your time on our site. Don't hesitate to return whenever you have more questions or need further clarification. Thank you for your visit. We're committed to providing you with the best information available. Return anytime for more. Get the answers you need at Westonci.ca. Stay informed by returning for our latest expert advice.
