Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

2
  • 4
    $\begingroup$ Nice! After thinking about your proof that this works, I thought of a different formulation of it. reveal spoilerPut a car in each city, and think of this as being in positions -10, -8, -6, ..., 8, 10 relative to Rome, where positive is clockwise and negative is counterclockwise. As the cars move, adjust their positions up or down by 1. Since all cars have the same parity, two cars can't switch signed positions without meeting, and once they meet, they're stuck together. So if car -10 and 10 both meet at 0, every car which was between them must be at 0 as well. $\endgroup$ Commented yesterday
  • $\begingroup$ @MishaLavrov yes, it makes the clearer that that police cars will indeed collect all cars. $\endgroup$ Commented 22 hours ago