olymmath

HMMT 2025 C8

  • Combinatorics

Albert writes 2025 numbers a1a_{1} , ..., a2025a_{2025} in a circle on a blackboard. Initially, each of the numbers is uniformly and independently sampled at random from the interval [0,1][0,1] . Then, each second, he simultaneously replaces aia_{i} with max⁡(ai−1,ai,ai+1)\max (a_{i - 1}, a_{i}, a_{i + 1}) for all i=1,2,…,2025i = 1, 2, \ldots , 2025 (where a0=a2025a_{0} = a_{2025} and a2026=a1a_{2026} = a_{1} ). Compute the expected value of the number of distinct values remaining after 100 seconds.

Dataset text NuminaMath olympiads. Quoted with source.

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

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2025/c8 · Tag F1CRPJMGFV · Edit this page on GitHub · Keys: j next, k previous