065Mathematics · Coordinate geometry

Shortest and longest distances to a circle

Shortest and longest distances to a circle

Shortest and longest distances to a circle · d_min,d_max

  • 55 bytes
  • COMP mode
01

Worked examples

Example 1

A circular recreation boundary has centre O(2,−1) and radius 4 units. A fixed observation point is P(14,4), and Q moves on the circumference. Which option gives the exact shortest and longest distances PQ?

  1. A.9 ; 17
  2. B.9 ; 13
  3. C.13 ; 17
  4. D.17 ; 21
Answer
A — shortest 9 units; longest 17 units.
Standard solution (without a calculator)
  1. Find OP: OP=√((14−2)²+(4−(−1))²)=√(144+25)=13 units.
  2. Classify P: Since OP=13>4, P is outside the circle. The reverse triangle inequality gives PQ≥OP−OQ=13−4=9.
  3. Find the upper bound: The triangle inequality gives PQ≤OP+OQ=13+4=17. The two centre-line points on opposite sides of O attain 9 and 17.
  4. Choose the answer: The exact minimum is 9 units and the exact maximum is 17 units, so choose A.
Do it on the calculator

Example 2

A circular path has centre O(−3,4) and radius 10 m. A worker is fixed at P(0,8), with all coordinates measured in metres. Q may move anywhere on the circumference. State whether P is inside, on or outside the circle, then find the exact shortest and longest PQ.

Answer
P is inside; shortest 5 m; longest 15 m.
Standard solution (without a calculator)
  1. Find the centre distance: OP=√((0−(−3))²+(8−4)²)=√(9+16)=5 m.
  2. Determine position: OP=5<10=r, so P lies inside the circle. Q is restricted to the circumference, so the shortest distance need not be zero.
  3. Find the minimum: PQ≥OQ−OP=10−5=5 m. Equality holds when Q is on the ray from O through P.
  4. Find the maximum: PQ≤OP+OQ=5+10=15 m. Equality holds for Q on the opposite ray; hence the exact distances are 5 m and 15 m.
Do it on the calculator

Example 3

A drone is fixed at P(−4,7), which is also the centre O(−4,7) of a circular navigation boundary of radius 8 km. Coordinates are in kilometres. Q moves on the circumference. Find the exact minimum and maximum PQ, and state how many points attain each extreme.

Answer
Minimum = maximum = 8 km; infinitely many points attain each.
Standard solution (without a calculator)
  1. Compare the coordinates: OP=√((−4−(−4))²+(7−7)²)=√0=0, so P=O.
  2. Use the circle definition: Every point Q on the circumference satisfies OQ=r=8 km. Since P=O, PQ=OQ=8 km for every Q.
  3. State both extrema: A constant distance of 8 km has minimum 8 km and maximum 8 km; no rounding is needed.
  4. Count the points: The circumference has infinitely many points, and every one attains both extrema. There is no unique nearest or farthest point.
Do it on the calculator
02

When to use it

For a fixed point P(x,y) and circle centre O(h,k) with radius r, let d=OP. The triangle inequality gives |d−r|≤PQ≤d+r for Q on the circumference; points on the centre line attain the bounds.

Enter the point and circle

  • Enter A = x and B = y for P, then C = h and D = k for the centre, then X = r. Use one coordinate system and one length unit.
  • Enter all five numbers explicitly, including zero. Blank EXE keeps the stored value; it is not an unknown-value convention. If a general circle equation is given, complete the square first.

Read the two distances

  • The first result is d_min=|OP−r|. Press EXE while Disp is lit to read the final d_max=OP+r. The LCD does not label the units or say whether P is inside the circle.
  • If P is inside the circle, the minimum is r−OP; if P is the centre, both distances equal r. These are distances to the circumference.

Question types

  • Original HKDSE Mathematics Compulsory Part practice: a moving point on a circle, point position and distance extrema. Use the triangle inequality or a centre-line diagram to justify the written answer.

Before you start

  • Use COMP / Deg / Norm 1 and an empty P1 with at least 55 bytes; P1–P4 share 680 bytes. A, B, C, D, X and Y are overwritten.
  • Require r≥0. A negative radius deliberately causes Math ERROR; r=0 is accepted as a single-point boundary, with equal minimum and maximum distances.
  • Q must lie on the circumference. If Q may move throughout the disk and P lies inside it, the shortest distance is 0 instead of r−OP.
  • At the centre, every circumference point gives the same distance r. The program gives distances only, without the coordinates or number of extremising points.
  • Coordinates and radius must share one length unit. The answers use that length unit; convert mixed units before entering.
  • Very large squared differences can overflow. Near-equal large coordinates or OP≈r can lose precision; retain the original data and round only at the end.
  • Enter every value explicitly on each run; variables are not reset. Press EXE between the two results and AC after the maximum.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.