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:
a=0
Step-by-step explanation:
im prbly wrong pls tell me if im wrong
The answe is 103.375, because when you divide 827 by 8, you get the answer of 103.375. To be sure, you may also type it in a calculator, and you'll noticed you'll get the same answer.
You round it to the nearest the
Answer:
x² - 30 + 5x
Step-by-step explanation:
(x + 5)(x − 5)
=x(x − 5)+5(x − 5)
=x² - 5 + 5x - 25
=x² - 30 + 5x
