#No. Of subsets can be formed from a set
34 messages ยท Page 1 of 1 (latest)
Hey @torpid dome, Thanks for sharing your math problem with us. While you wait for a Helper to help you, we want to share some vital information with you.
โ Please take a moment to read the helpee guidelines. This will make sure that your post follows the helpee rules of our community.
โ Please don't ping <@&775784618955505685>, <@&1283689826742440016>, <@&819616364188139550>, or <@&624327278137966593> for help because their job is to take care of the server's administrative tasks, not to answer queries directly. However, if you have a problem with how a Helper is acting, you can ping a Helper Moderator.
โ It's always very useful if you can show us the work you've done so far. This makes it easier for our Helpers to find mistakes and help you get to the right answer.
So there's a formula given in my book for finding the number of subsets that can be formed of a set
Basically assume a set A
Then no. Of subsets = 2^(n(a))
And if we look at this another way round
Suppose A={1,2,3,4,.....,n}
Such that n(A)=n
So notice that
If we form combinations, we can find subsets
Firstly by choosing 1 from n
Then adding after choosing 2
And so on
We have to put 0 to for the null set
So
$\sum_{r=0}^n \frac{n!}{r!(n-r)!}$
Conqueror
It is
Have you heard of binomial expansion ?
Yeah
Please thank the helpers who assisted you by clicking the buttons below. You can thank each helper only once. Once you're done, click "Close Post" to close this thread.
Thank you for your feedback! Rotor the motor has been awarded 1
. They now have 855
. They have 3
daily left for today.