Please teach me how to solve part b, thank you.

Part (a)

The locus is the set of points that satisfy the given conditions. Namely that the point P needs to be 1 unit from the line given.

Think of a median along a highway. Then imagine the two shoulders of the road. The locus describes the two parallel lines that are to this given median. In other words, the median is y = x+2 and the road shoulders are unknown for now.

Though we do know that parallel lines have equal slopes (but different y intercepts).

Therefore, the answers to the next section will be of the form y = x+k for some real number k.

=============================================================

Part (b)

Use your favorite graphing tool to plot y = x+2. I recommend GeoGebra since I use it all the time, and it's what I used to make the drawing below. Desmos is another tool you can use. Both are free.

Note that point A(0,2) is on the line y = x+2. The line perpendicular to y = x+2 and goes through (0,2) is y = -x+2. From here, plot a circle centered at (0,2) with radius 1. The equation of this circle is x^2 + (y-2)^2 = 1

The intersection points of the circle and y = -x+2 will provide starting points, so to speak, for the two shoulder lines I mentioned in part (a).

The approximate locations of those points are:

B = (0.71, 1.29)

C = (-0.71, 2.71)

From here, it shouldn't be too hard to find the y = mx+b forms of the locus lines. Let me know if you need help with that, or if you need me to check your answers.

Side note: Why is it called a locus? I'm not sure, but my gut feeling tells me it has to do with the insects of a similar sounding name (locus the math term and locust the insect). Imagine millions of them forming various shapes in the sky, similar to how many points are used in the 2D plane to create various curves.

answer: 20

step-by-step explanation: subtract the minimum date value from the maximum data value to find the date range. in this casem the date range is 42 - 22 = 20

hope this ! : ) ~zane

10010010001010010101001001010010100101010010101010010010101010110010001011010010010001

step-by-step explanation: