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.
Bir tam sayı ve bir basit kesir ile ifade edilen kesirlere taam sayılı kesir denir.
The correct answer for this would be X=10
Answer:
Step-by-step explanation:
Since we're looking at perpendicular lines, the slope of the new line is the reciprocal of the original line.
So the slope of our new line is 
So far, we are looking at 
Now we need to find the b value by plugging in the given point.
So the final equation is
Answer:
(7,5)
Step-by-step explanation:
{2x + 4y = 34
{4y = 27 - x
2x + 27 - x = 34
x=7
4y = 27 - 7
y = 5 so the answer is ( 7,5)
