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:
The length of the BC is 25 units .
Step-by-step explanation:
As shown in the diagram
In ΔABC
∠B = ∠C (As given)
(If the angles are equal than their opposite sides are also equal .)
Thus
AB = BC
As given
AB = 4x + 4
AC = 6x - 14
Thus
4x + 4 = 6x - 14
6x - 4x = 14 + 4
2x = 18

x = 9
Put in the
BC = 2x + 7
= 2 × 9 + 7
= 18 + 7
= 25 units
Therefore the length of the BC is 25 units .
Answer
It is 11/12
hope im not late i hope it helps
Step-by-step explanation:
Try Photomath Even scans the problem from your paper
#2