Answer: There are 
ways of doing this
Hi!
To solve this problem we can think in term of binary numbers. Let's start with an example:
n=5, A = {1, 2 ,3}, B = {4,5}
We can think of A as 11100, number 1 meaning "this element is in A" and number 0 meaning "this element is not in A"
And we can think of B as 00011.
Thinking like this, the empty set is 00000, and [n] =11111 (this is the case A=empty set, B=[n])
This representation is a 5 digit binary number. There are 
of these numbers. Each one of this is a possible selection of A and B. But there are repetitions: 11100 is the same selection as 00011. So we have to divide by two. The total number of ways of selecting A and B is the 
.
This can be easily generalized to n bits.
Answer:8
Step-by-step explanation:
8N is the equation
And a coefficient is the number in front of a letter
There are 13 diamonds in the deck, so 
ways of drawing 3 diamonds.
There is a total of 
ways of drawing any 3 cards from the deck.
So the probability of drawing 3 diamonds is
where 
.
According to the conversion table we know,
1 meter = 100cm
This means if we need to convert meters to centimeters, we need to multiply by 100
Or
If we need to convert from centimeters to meters, we need to divide by 100.
Here the length of the wire needed to wrap 175 bundles = 2975 cm.
Now as we need to convert it to meters.
We need to divide this by 100.
We get
2975/100= 29.75
So 2975 cm = 29.75 m
Option D) is the right answer
Answer:
1.25
Step-by-step explanation:
In India
