

Step-by-step explanation:



By using


<u>Now</u><u> </u><u>putting</u><u> </u><u>the</u><u> </u><u>value</u><u> </u><u>of</u><u> </u><u>h</u><u> </u><u>=</u><u> </u><u>0</u>
<u>
</u>
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.
If you take 0.98 and multiply by 2.5 you get 2.45 so there is no better deal. ☺
Answer:
2b - 14
Step-by-step explanation:
2(b – 7)
2b - 14
1/5 = 3/15
1/3 = 5/15
2/3 = 10/15
So no :)
Reason why:
You want to find the common denominator between all three fractions, so all fractions are the same proportions. So in this case, if you multiply 5*3 you get 15, making it the common denominator. Then since you multiplied the 5 in 1/5 by 3 to get 15, and you have to multiply the 3 in 1/3 and 2/3 by 5 to get 15, then you multiply the numerator by the same number.
Sorry I am terrible at explaining things. Hope this helped though!