Answer:
This is solved by Distance Formula
D²=(x2_x1)²-(Y2-y1)²
So D²= (-5-0)²-(1-1)²
D²=25
We can solve D by square root so
D=5
the Distance or length between a and b was 5
you can solve for c and d in a such way
Thanks in Advance
Nahom Wondale
Answer:
- see the attached for domain
- Range: (-∞, 4], [3, ∞), [-3, 1]
Step-by-step explanation:
The domain is the horizontal extent of the graph. When the graph has arrows on the end, it extends to infinity in the indicated direction.
__
The range is the vertical extent of the graph.
<u>Left Graph</u>
We assume the curve is intended to touch, not cross, the line y=4, so the range is ...
range: (-∞, 4]
__
<u>Middle Graph</u>
We assume the graph continues along the line y=3 to the right indefinitely. Then this value is the minimum of the range.
range: [3, ∞)
__
<u>Right Graph</u>
The low point on the graph is at y=-3, and it looks like the graph continues to the right along the line y=1. Then the range is ...
range: [-3, 1]
If I got it correctly, the question is what is 24x^2y^6-16x^6y^2+4xy^2 divided by 4xy^2 and the answer is 6xy^4-4x^5+1.
Compatible numbers are rounded numbers. the compatible number for 777 is 800 , and the compatible number for 248 is 200 because I rounded to the nearest hundreds place
I hope I helped you!!!!<3
Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer