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.
30 degrees is the value of the missing angle. Since, this triangle is known as an Isosceles all angles are equal.
Do 24/30, which is 0.8. Convert this to a percentage
==============> 80%
Answer:
5.13
Step-by-step explanation:
Look at the number at the end, and if it's 5 or more, round up. the 6 is greater than or equal to 5, so you round up, dropping the six and making the 2 into a 3, giving you 5.13.
Answer:
Um... Sure?
Step-by-step explanation:
Okay, 'll go to your questions...
