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:
one answer
Step-by-step explanation:
set the equal to each other and you get one answer
2x+6= -3x -4
Irrational
We know that pi is irrational (we can’t express it as a ratio of two numbers), and we are multiplying it by a rational number (-2). However -2 lots of something with infinite digits, will still have infinite digits, therefore it is irrational.
Check the picture below.
recall that in a square, all sides are equal, so if we make b = a, then we get that for one side, also recall that the area of a rectangle is length*width, so in this case,
Answer:
slope = y = 1/2
y-intercept = b = -3
Step-by-step explanation:
slope intercept equation:
y = mx + b----->(equation 1)
m is slope
b is y-intercept
y = 1/2x - 3----->(equation 2)
Compare (equation 1) and (equation 1)
slope = y = 1/2
y-intercept = b = -3
