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.
Perimeter=(2*length)+(2*width)
length=2*w
132=(2(2w))+(2w)
132=(4w)+(2w)
132=6w
w=22
l=44
Answer: 10.8
Step-by-step explanation: the pythagorean theorem is A sqaured or A^2 + B^2 or B squared equals C^2 or C squared so 10 squared as is the first number is 100 and 4 squared as is the second number is 16 add the two to get 116 but since your answer is squared you need to take the square root which means your answer is 10.7703296143 but since your rounding to the tenths place your answer is 10.8
I believe the answer is either C or D... I am not sure though..