olymmath

BxMO 2022 Problem 2

  • Answer

Let nn be a positive integer. There are nn ants walking along a line at constant nonzero speeds. Different ants need not walk at the same speed or walk in the same direction. Whenever two or more ants collide, all the ants involved in this collision instantly change directions. (Different ants need not be moving in opposite directions when they collide, since a faster ant may catch up with a slower one that is moving in the same direction.) The ants keep walking indefinitely. Assuming that the total number of collisions is finite, determine the largest possible number of collisions in terms of nn.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

n(n-1) / 2

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator benelux/2022/p2 · Tag N4Y7RWKCK6 · Edit this page on GitHub · Keys: j next, k previous