Are you sure that you typed in this problem correctly? The answer to this involves coordinates with decimals. Our goal is to split JK into 5 congruent segments, that way if you take the first point closest to J and call it P, from P to J is one of the congruent segments while P to K is 4 of these congruent segments thereby satisfying your condition.

I am using geometry to do this, because the formulas you are taught in coordinate geometry won't help you. If you plot your point J and draw a vertical segment going down, then plot point K and draw a horizontal to the left you will form a triangle. let's call where those 2 segments meet pt A having coordinates (-2,-3). You can now just count the boxes to find the length of JA and KA. JA = 8 and KA = 4. If you split each of thes into 5 congruent segments, the pieces would have a lenth of 8/5 = 1.6 and 4/5= .8 If you now label these starting from point A and going to pt J by adding 1.6 to the y value you'd get

(-2,-1.4), (-2, .2), (-2, 1.8), (-2, 3.4) and then finally pt J . Notice these 4 pts split JA into 5 congruent segments.

Doing the same for KA using .8 changing the x value this time, you'd get

(-1.2, -3), (-.4,-3), (.4,-3), (1.2,-3) and then finally pt K. Notice these 4 pts split KA into 5 congruent segments.

Now if you draw horizontals from each of the pts on JA and verticals up from each of the points on KA, you'll see that they intersect on JK. These coordinates will split JK into 5 congruent segments. They are

(-1.2, 3.4) (-.4, 1.8), (.4, .2), (1.2, -1.4). These 4 pts split JK into 5 congruent segments. Point P must be the closest one to point J.

P(-1.2,3.4) is your answer. Like I said at the start, I think I just answered a much harder question than was intended.

Hope this helped.

## Comments