Insects Reversing on a 1 m Stick: Longest Time Until the Stick Is Empty

Quick Overview

A probability brainteaser about 100 insects placed at random on a 1 meter stick, each walking at 1 cm per second in a random direction and turning around whenever two meet. Asks for the longest possible time until every insect has fallen off, testing symmetry arguments that simplify collisions.

Insects Reversing on a 1 m Stick: Longest Time Until the Stick Is Empty

Company: Quantbot Technologies

Role: Quantitative Researcher

Category: Statistics & Math

Difficulty: easy

Interview Round: Technical Screen

One hundred insects are placed at random positions on a stick 1 meter long, and each one faces left or right at random. They all start walking at the same moment, at 1 cm per second. When two insects meet, both immediately turn around and continue at the same speed in the opposite direction. An insect that reaches either end of the stick falls off. What is the longest time it can take until the stick is empty? ```hint Watch from far away Imagine you cannot tell the insects apart. What does a meeting, followed by both insects turning around, look like from a distance? ``` ```hint One insect alone Once the meetings no longer matter, ask how long a single insect can possibly stay on the stick. ``` ### Constraints and Clarifications - Treat each insect as a point; turning around takes no time. - Each insect's position and direction are chosen independently of the others. ### Clarifying Questions - Are the insects points, or do they have a length that makes them touch before their centres meet? - Does an insect that starts exactly at an end and faces outward fall off immediately? - Is the question about the worst case over all placements and directions, or about the expected time under the random placement? ### What a Strong Answer Covers - A reduction that removes the meetings from the problem, with a short argument for why it is valid - The worst-case time, with a starting configuration that reaches or approaches it - Careful units and boundary cases, such as an insect starting at an end - Why the bound does not depend on the number of insects or of meetings ### Follow-up Questions - Under the random placement, what is the distribution of the time until the stick is empty, and what is its expected value? - How many insects fall off the left end, and which ones? - How many meetings take place in total, at most and on average?

Overview: A probability brainteaser about 100 insects placed at random on a 1 meter stick, each walking at 1 cm per second in a random direction and turning around whenever two meet. Asks for the longest possible time until every insect has fallen off, testing symmetry arguments that simplify collisions.

Quantbot Technologies logo
Quantbot Technologies
Nov 16, 2026
easyQuantitative ResearcherTechnical ScreenStatistics & Math
0
0

One hundred insects are placed at random positions on a stick 1 meter long, and each one faces left or right at random. They all start walking at the same moment, at 1 cm per second. When two insects meet, both immediately turn around and continue at the same speed in the opposite direction. An insect that reaches either end of the stick falls off. What is the longest time it can take until the stick is empty?

Constraints and Clarifications

  • Treat each insect as a point; turning around takes no time.
  • Each insect's position and direction are chosen independently of the others.

Clarifying Questions Guidance

  • Are the insects points, or do they have a length that makes them touch before their centres meet?
  • Does an insect that starts exactly at an end and faces outward fall off immediately?
  • Is the question about the worst case over all placements and directions, or about the expected time under the random placement?

What a Strong Answer Covers Guidance

  • A reduction that removes the meetings from the problem, with a short argument for why it is valid
  • The worst-case time, with a starting configuration that reaches or approaches it
  • Careful units and boundary cases, such as an insect starting at an end
  • Why the bound does not depend on the number of insects or of meetings

Follow-up Questions Guidance

  • Under the random placement, what is the distribution of the time until the stick is empty, and what is its expected value?
  • How many insects fall off the left end, and which ones?
  • How many meetings take place in total, at most and on average?