ANSWER

EXPLANATION
The given equation is

Take antilogarithm of both sides to base e.

This will simplify to

Group like terms to obtain,


Take square root of both sides to get,
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.
The answer is 5/6 box.
This is because when you add up how much they ate you have 5/6 left.
Answer:
24
Step-by-step explanation:
Equilateral has 3 angles that add up to 180, and all angles are equal
3(2x+12) = 180
6x+36 = 180
180-36 = 6x
144 = 6x
24 = x
Answer:
11.52
Step-by-step explanation:
You switch the percent to a decimal and move the number two times to the right so for example 50 percent turns into .5 multiply .32 times 36 is 11.52