646 views

1 Answer

0 votes
0 votes

each element has 2 states, there or not there, so there are

2^100 different ways of choosing sets there or not there, including none of them there (the empty set)

so there are

2^100 - 1 non empty subsets

100C1 + 100C2 have 2 or less elements

2^100 - 1(0 element) - 100C1(1 element) - 100C2(2 element) = 2^100 - 1 - 100 - 4950 = 2^100 - 5051

more than 2= tatal-(less than 2 include 2)

Related questions

2.0k
views
1 answers
0 votes
admin asked Apr 29, 2020
1,959 views
How many bit strings of length $10$ haveexactly three $0s?$ more $0s$ than $1s?$at least seven $1s?$ at least three $1s?$
3.8k
views
1 answers
1 votes
admin asked Apr 29, 2020
3,752 views
A coin is flipped $10$ times where each flip comes up either heads or tails. How many possible outcomesare there in total?contain exactly two heads?contain at most three tails?contain the same number of heads and tails?
1.9k
views
1 answers
0 votes
admin asked Apr 29, 2020
1,880 views
A coin is flipped eight times where each flip comes up either heads or tails. How many possible outcomesare there in total?contain exactly three heads?contain at least three heads?contain the same number of heads and tails?
816
views
1 answers
0 votes
admin asked Apr 29, 2020
816 views
How many subsets with an odd number of elements does a set with $10$ elements have?