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:
8 units squared
Step-by-step explanation:
Here's the formula of a triangle
base*height divided by 2
So, we know that the base is 4.
We have to work backwards.
16*2 is 32
32 divided by 4 is 8.
Now let's see
8*4 is 32 divided by 2 is 16!
Hope you understand :)
Multiplying 34x 17 and you will get answer
The greatest common factor of 18 and 36 is 18.
So, 18 goes into 18 once, and 18 goes into 36 twice.
1/2 is the fraction in simplest form.