<em>Greetings from Brasil....</em>
As stated in the statement of the question, EF is a bisector of CD, so point G is the median point of CD, so CG = GD
5X - 1 = 7X - 13
X = 6
EF = EG + GF
6X - 4 = EG + 13 x = 6, so
6·6 - 4 = EG + 13
<h2>EG = 19</h2>
<em>(see attachment)</em>
Answer: A
Step-by-step explanation:
QUESTION:
The code for a lock consists of 5 digits (0-9). The last number cannot be 0 or 1. How many different codes are possible.
ANSWER:
Since in this particular scenario, the order of the numbers matter, we can use the Permutation Formula:–
- P(n,r) = n!/(n−r)! where n is the number of numbers in the set and r is the subset.
Since there are 10 digits to choose from, we can assume that n = 10.
Similarly, since there are 5 numbers that need to be chosen out of the ten, we can assume that r = 5.
Now, plug these values into the formula and solve:
= 10!(10−5)!
= 10!5!
= 10⋅9⋅8⋅7⋅6
= 30240.
Answer:
TRUE
Step-by-step explanation:
TRUE
a_1 = 2
a_n = 2*(an_1)
if we start with 2, we would get
a_2 = 2*(a_1) = 2*(2) = 4
a_3 = 2*(a_2) = 2*(4) = 8
a_4 = 2*(a_3) = 2*(8) = 16
a_5 = 2*(a_4) = 2*(16) = 32
.
.
.
and so on
Answer:
C choice.
Step-by-step explanation:
First, we move the same terms to the same side.
Then we move 6 to divide - 18.
