ARCHETYPE: Chase, Catch & Meet
Around 450 BCE, the philosopher Zeno of Elea claimed that swift Achilles could never catch a tortoise with a head start: by the time Achilles reaches where the tortoise was, the tortoise has crawled a little further, forever. The paradox teased thinkers for two thousand years, and the modern resolution is almost insolently simple — write each runner's position as a function of time, set the two expressions equal, and solve. The infinitely many "catching-up stages" collapse into one linear equation with one finite answer. That single move, position functions plus a shared clock, is the master key to an entire family of examination problems. The family is everywhere. A police jeep accelerates after a thief who sped past a checkpoint. A man sprints for a bus that has just pulled away. Two trains close in on one another on the same line. Car B leaves two hours after car A and must catch it. CBSE and ISC set these as structured three-mark problems; JEE-Main and NEET compress them into two-minute MCQs; JEE-Advanced sharpens them into "find the minimum speed to catch" questions where the chase only just succeeds. Different costumes, same skeleton: two movers, one axis, one meeting condition. So this article treats the setup itself as the concept — the way the Atwood machine module treats pulleys. You will build the master pattern once, learn the relative-motion shortcut that halves the algebra, decode what the quadratic's two roots physically mean, and drill the four variants examiners recycle every year. After that, every chase on paper is fill-in-the-blanks.
- Every chase-and-meet problem is two position functions on one axis with one shared origin and one shared clock: and .
- The whole physics of "meet", "catch", "overtake", "collide" is a single condition: — solve for , substitute back for the place.
- The relative-motion shortcut collapses two movers into one: track the gap with relative velocity and relative acceleration ; the chase ends when the gap hits zero.
- When the meeting equation is quadratic, its discriminant speaks: two roots = catch and re-pass, equal roots = barely catches (the minimum-speed case), no real roots = never meets.
- Equal speeds is the moment of closest approach or maximum lead — never, by itself, the meeting.
- Key idea: put both movers on one axis with one clock, and every chase question becomes "solve ".
Two objects on the same line meet when their position functions, written from a common origin with a common clock, are equal — ; every chase, catch, overtake and head-on problem is that one equation, and the relative-motion form (gap shrinking at , changing at ) is the same equation with half the algebra.
Where this lives today
Rendezvous is the chase-and-meet archetype flown for real. When a cargo spacecraft docks with the International Space Station, guidance computers propagate two position functions and steer the relative state — gap and closing rate — to zero at contact, exactly the formulation of this module (with orbital dynamics supplying fancier accelerations). Air-traffic control runs the same mathematics defensively: conflict-alert software continuously solves "will these position functions ever get too close?", which is the no-real-roots condition read as a safety guarantee. On the ground, adaptive cruise control and automatic emergency braking are chase problems solved thirty times a second: your car measures the gap and closing speed to the vehicle ahead by radar, computes whether the gap function will reach zero, and intervenes when the discriminant threatens to turn positive. And every navigation app's "you will catch the 6:40 ferry" is a delayed-start catch-up computation — Worked Example 1 with live traffic feeding the speeds.
The setup
Geometry first, because in an archetype the geometry is the physics. One straight road, taken as the -axis. Two movers — call them the leader (head start , velocity , acceleration ) and the chaser (starts at the origin, velocity , acceleration ). One origin, one positive direction, and — this is the part that saves marks — one clock, started at a single agreed event.
Each mover then carries its own uniformly-accelerated position function — the second kinematic equation from the Kinematic Equations module, promoted from "displacement" to "position" by adding the starting coordinate:
where: — the leader's head start (its position when the clock starts); — velocities at ; — accelerations (zero for constant-speed movers). Read these as complete biographies: feed any into and it reports where the leader is, no storytelling required. All the drama of a chase — who is ahead, by how much, closing or opening — lives in the difference of these two functions, which is why the shortcut below works. Two conventions do the silent heavy lifting. First, head-on problems put the movers at opposite ends: give the second mover position if it starts at moving backward — its velocity enters with a minus sign on the shared axis. Second, delayed starts keep one clock: if the chaser leaves a time after the leader, the leader has been moving for but the chaser only for , so the chaser's function uses wherever appears. Never run two clocks.
The master solution pattern
Every question in the family is one of three sentences about the same pair of functions: when are they equal (meet/catch/overtake), when is their difference extreme (closest approach, maximum lead), or can they ever be equal (minimum speed to catch). The pattern: write equation (1) with correct signs, then impose the sentence.
We derive the general meeting time for two uniformly accelerated movers and — the exam-critical part — decode the physical meaning of the quadratic's two roots. The strategy: set the position functions equal, collect into a standard quadratic in , and interrogate the discriminant. Watch for the physical filter at the end: mathematics happily returns negative times and both intersections, and you must select the root the question is asking about.
Step 1. Impose the meeting sentence on equation (1): , i.e.
Step 2. Collect everything on one side into standard form:
Why: only the DIFFERENCES of the velocities and accelerations survive, plus the initial gap. The chase never cared about the individual motions — a first hint of the relative-motion shortcut.
Step 3. If (both constant-speed, or equal accelerations), the quadratic degenerates to a linear equation with the single root
Why: gap over closing speed — the most quoted formula in the family. It requires : a slower chaser never closes a gap that shrinks at a constant rate.
Step 4. Otherwise solve the quadratic. The discriminant classifies the chase: with two positive roots means the chaser catches, passes, and is later re-passed (the second root is the re-overtake, not an error); means the chaser barely touches the leader at exactly one instant — the minimum-speed / just-catches case; means the gap never closes.
Step 5. Physically filter the roots: discard negative times, and read the question — "when does he catch" wants the smaller positive root; "when does the bus escape again" wants the larger. Verified: limits — gives (they start together, trivially "meeting"); and gives no solution for (identical motion preserves the gap forever). Worked Example 4's numbers land on this template: gives and s, catch then re-pass.
Go deeper · Derivation B · 1 minThe relative-motion shortcut — collapsing two movers into one
We re-derive the meeting condition by riding along with the leader, which converts every two-body chase into a one-body problem and typically halves the algebra. The idea: only the gap matters, so track the gap directly. Its rate of change is the relative velocity and its curvature is the relative acceleration — the 1D case of the Relative Velocity & Reference Frames module. The thing to watch: choose ONE sign convention for "closing" and stay loyal to it.
Step 1. Define the gap , the leader's lead. Subtracting the two lines of equation (1):
Why: the gap is itself a uniformly-accelerated "particle" with initial value , initial velocity and acceleration . Every kinematic equation you know applies to the gap directly.
Step 2. Rename in chase language: the chaser closes at relative velocity and relative acceleration . The gap obeys .
Step 3. The meeting sentence becomes one clean statement: . For constant speeds this is , i.e. time = gap ÷ closing speed, and for head-on motion the closing speed is because the velocities carry opposite signs on the axis.
Step 4. The closest-approach sentence becomes: the gap is extremal when its rate of change vanishes — when the two speeds are momentarily equal. Feed that instant back into for the minimum gap or maximum lead. Why: this is the origin of the most important non-obvious fact in the family — equal speeds is the turning point of the gap, NOT the meeting. A chaser still slower than the leader is still losing ground; the catch, if it comes, comes after the speeds cross. *Verified: the v²-over-2a check — a chaser at constant behind a leader accelerating from rest at has gap extremal at , where the gap has shrunk by ; catching requires , reproducing the discriminant condition of the previous derivation exactly. Both routes agree, as they must.*
The pattern in table form — the four variants exams actually pose:
| variant | setup on the axis | condition to impose | classic answer shape |
|---|---|---|---|
| catch-up (both constant speed) | chaser behind by , faster | ||
| head-on meeting | start apart, opposite velocities | ||
| police–thief (chaser accelerates from rest) | thief constant passes post; jeep starts, | ; jeep speed at catch | |
| bus chase (leader accelerates from rest) | runner constant , bus gap , accel | catches iff ; equality = graze |
Limiting cases
| case | result | meaning |
|---|---|---|
| , no accelerations | overwhelming chaser: time is just gap over own speed | |
| (constant speeds) | matching speed freezes the gap — the chase never ends | |
| (plus a second root if accelerations differ) | starting level: any speed edge catches instantly | |
| head-on, one mover stopped | the moving one covers the whole separation alone | |
| bus chase, exactly | discriminant zero, one root | grazes the bus at matched speeds — the minimum-speed catch |
| bus chase, | no real root; closest gap | never catches; the shortfall is read off the gap function |
Worked examples
1 · Board level — the delayed start (CBSE/ISC pattern, 3 marks)
Car A leaves a toll gate at a steady . Two hours later, car B leaves the same gate at a steady along the same road. When and where does B catch A?
Step 1. One origin (the gate), one clock — start it when B leaves. A has a head start .
Step 2. Positions: , (in km, t in hours). No accelerations, so the meeting is linear.
Step 3. Impose : after B starts (6 h after A started). Shortcut check: gap ÷ closing speed h ✓.
Step 4. Where: from the gate. Cross-check with A: km ✓.
2 · Board level — head-on trains (ISC/CBSE pattern)
Two stations lie apart. A passenger train leaves the first at while a goods train simultaneously leaves the second, heading toward it at . When and where do they meet?
Step 1. Shared axis from the first station. Passenger train: . Goods train starts at moving in the negative direction: . The minus sign IS the head-on physics.
Step 2. Impose : . The closing speed is the sum — opposite velocities close the gap together.
Step 3. Meeting point: from the first station (and ✓).
Step 4. Classic add-on: a bird flying at back and forth between the approaching engines covers — no infinite series needed — simply speed × time . The bird question is the meet question wearing a costume.
3 · Competitive level — police and thief (JEE-Main/NEET pattern, ~2.5 minutes)
A thief on a motorbike passes a stationary police jeep at a constant . At that very instant the jeep gives chase with constant acceleration . Find when and where the jeep catches the bike, and the jeep's speed at that moment.
Step 1. Convert units before anything: . Clock starts at the passing moment; both begin at the origin, so .
Step 2. Positions: bike , jeep . Impose : .
Step 3. The root is the passing moment itself; the catch is the other root: , at .
Step 4. Jeep's speed at the catch: — exactly twice the thief's speed. Not a coincidence: catching from rest with equal start means equal average speeds, and a uniformly accelerating jeep averaging must finish at . Timing note: ~2.5 min. The factor-of-two ending is a reusable theorem — for any start-from-rest chase with , catch time and catch speed . Quote it and this becomes a 40-second question.
4 · Competitive level — the bus chase, minimum speed (JEE-Advanced flavour, ~4 minutes)
A student stands behind a bus when it starts from rest with constant acceleration . (a) Running at a constant , when does she reach the bus? (b) What is the minimum constant speed with which she could just catch it?
Step 1. Gap function (relative-motion shortcut): the gap starts at m, closes at ... better, write it directly: .
Step 2. Catch when : , so (catches the door) — and s is the moment the accelerating bus, if she never boarded, would sweep past her again. Two roots, two real events.
Step 3. Minimum speed: catching just barely means the discriminant vanishes. For speed : , discriminant , so . This is the template ✓.
Step 4. At the graze, s and the bus speed is — equal to hers. The minimum-speed catch happens exactly at matched speeds: the tangency of the position–time curves, and the one case where "equal speeds" and "meeting" coincide. Timing note: ~4 min the first time, ~90 s once and the tangency picture are yours. On MCQs, check the discriminant before hunting roots — "does she catch it at all?" is often the actual question.
Exam traps
Two clocks. In delayed-start problems, writing and with each meaning "time since that car started" makes the positions incomparable. One clock: , for — or restart the clock at B's departure and bank A's head start as , as in Worked Example 1. Either discipline works; mixing them costs the full three marks.
Head-on velocities entered with the same sign. On one axis, movers approaching each other have oppositely-signed velocities; the closing speed is the sum of the speeds. Writing for a train coming toward the origin sends it the wrong way and produces a nonsense meeting behind the second station.
Equal speeds read as the catch. Equal speeds is the gap's turning point — closest approach or maximum lead (see the warning box). Impose equal positions for meetings; use equal speeds only when the question says "closest", "maximum separation", or "just barely".
Dropping the second root. A quadratic meeting equation with two positive roots is telling a story: catch, then re-pass. "When does he catch it" wants the smaller root; discarding "the ugly root" mechanically loses the part (b) that JEE-Advanced loves to ask.
Forgetting km/h → m/s. Mixed units are deliberately planted: against must become (multiply by ) before any equation is written. A jeep "catching" the thief in s is the tell that someone skipped it.
Answering the time but not the place (or vice versa). "When and where" is two answers and usually two marks. Substitute your back into either position function — and into the other as a free cross-check.
Negative or zero roots discarded thoughtlessly. in Example 3 was the passing event that started the clock — physical, just not the answer. A negative root means "the meeting already happened before the clock started" in the extrapolated motion; state that, don't just cross it out, when a question asks you to interpret.
Origins · 1 minRené Descartes and how this was discovered
Descartes made "where is it, as a function of what?" a mathematical question. His La Géométrie (1637) — published as an appendix to the Discourse on Method — welded algebra to geometry: curves became equations, and the intersection of two curves became the simultaneous solution of two equations. That is precisely the machinery of this module. A chase is two graphs in the position–time plane; the catch is their intersection; the just-catches case is tangency — all Cartesian vocabulary. Legend says the coordinate idea came to him watching a fly wander the ceiling from his bed, wondering how to report its position with numbers. Whether or not the fly existed, every you write, every meeting you find by setting two expressions equal, is Descartes' program running exactly as designed, four centuries on.
Going further
Texts. NCERT Physics Class 11, Ch. 3 (Motion in a Straight Line, relative-velocity section) · HC Verma, Concepts of Physics Vol. 1, Ch. 3 · Halliday, Resnick & Walker, Fundamentals of Physics, Ch. 2 (the moving-bodies problem set).
Provenance. All results are standard uniform-acceleration kinematics. A verifier should recompute: Example 1 ( h, km by both functions); Example 2 ( h, km, bird km); Example 3 ( s, m, jeep at ); Example 4 ( s; ; graze at s with matched speeds); the closest-gap formula in the limiting-cases table.
Prerequisites. Kinematic Equations for Uniform Acceleration · Acceleration. Leads to. Trains Crossing & Overtaking · River–Boat Crossing · Graph Reading at Speed — with the frame-changing generalization in Relative Velocity & Reference Frames.
Do I start the clock when the first object moves or when the second one does?
Either — but exactly one. Both conventions appear in textbook solutions, which is why this confuses everyone at 2am. Starting the clock at the later event (Worked Example 1) is usually cleaner: the earlier mover's progress so far becomes a plain head start , and both functions then use the same with no bookkeeping. If you instead start at the first event, write the latecomer's position with and remember it only exists for . What you must never do is give each mover its own personal .
How do I know whether to expect one meeting or two?
Count the curvatures. Two constant-speed movers have straight position–time graphs: at most one intersection. The moment one mover accelerates, its graph curves, and a line can cut a parabola twice — catch and re-pass, like Worked Example 4's s and s. The discriminant of the meeting quadratic is the formal test: positive means two meetings, zero means a single grazing touch, negative means never. Asking "which root does the question want?" before solving saves you from reporting the re-pass as the catch.
Why is the closing speed the SUM of the speeds for head-on motion? It feels like double counting.
Because both movers eat into the same gap simultaneously. In one second, a 60 km/h train removes 60/3600 km from the gap at one end while the 90 km/h train removes 90/3600 km at the other: total shrinkage 150/3600 km, no double counting — two workers, one trench. Formally, on a shared axis the velocities are and , and the gap's rate of change is their difference, km/h. The sum appears because subtracting a negative adds.
In the police-thief problem, why does the jeep end up at exactly twice the thief's speed? Is that always true?
It is a theorem for the specific — and most common — setup: both start from the same point at the same moment, the leader at constant , the chaser from rest with constant acceleration. Over the chase, equal positions in equal time force equal average velocities. The thief's average is ; the jeep's average, accelerating uniformly from rest, is half its final speed. Half the final speed means final speed , independent of the acceleration's value — a larger shortens the chase but still delivers the factor two. Give the leader a head start and the tidy factor breaks.
Can I always use the relative-velocity shortcut instead of two position functions?
For finding when — yes, and it is usually faster: gap, closing rate, closing acceleration, solve . Its blind spot is where: the shortcut lives entirely in the gap and forgets the ground. To report the meeting place you must return to an actual position function and substitute the meeting time. A good exam rhythm: shortcut for , one line of for the place, the other position function as a free cross-check.
What if BOTH objects accelerate?
Nothing new — the machinery absorbs it. The meeting equation keeps the form of the master derivation with ; if the accelerations happen to be equal, the terms cancel and the problem collapses back to the linear gap-over-closing-speed case (equal accelerations are invisible to the gap). JEE-Advanced enjoys the special case where the chaser both starts slower and accelerates harder: the gap first grows, peaks when the speeds match, then shrinks to the catch — three phases, one quadratic.
Are these problems connected to the graphs questions on my paper?
Deeply — the second figure is the whole story. On a position–time plot, meetings are intersections, speeds are slopes, closest approach is where the two tangents run parallel, and the just-catches case is tangency of the two curves. Many MCQs are solved fastest by sketching the two graphs and reading the geometry, no algebra at all: the Velocity–Time Graphs module and the Graph Reading at Speed technique module drill exactly that reflex. If a chase MCQ offers graphs among the options, geometry first, algebra second.