question
stringclasses 2
values | answer
stringclasses 2
values |
|---|---|
Compute the number of ways to arrange $3$ copies of each of the $26$ lowercase letters of the English alphabet such that for any two distinct letters $x_{1}$ and $x_{2}$, the number of $x_{2}$ 's between the first and second occurrences of $x_{1}$ equals the number of $x_{2}$ 's between the second and third occurrences of $x_{1}$.
|
2^{25} \cdot 26!
|
Albert writes $2025$ numbers $a_{1}, \ldots, a_{2025}$ in a circle on a blackboard. Initially, each of the numbers is uniformly and independently sampled at random from the interval $[0,1]$. Then, each second, he \emph{simultaneously} replaces $a_{i}$ with $\max \left(a_{i-1}, a_{i}, a_{i+1}\right)$ for all $i=1,2, \ldots, 2025$ (where $a_{0}=a_{2025}$ and $a_{2026}=a_{1}$ ). Compute the expected value of the number of distinct values remaining after $100$ seconds.
|
\frac{2025}{101}
|
README.md exists but content is empty.
- Downloads last month
- 6