2025 SSMO Relay Round 5 Problems/Problem 2

Revision as of 11:44, 9 September 2025 by Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Ethan places <math>T</math> red cards and <math>T</math> blue cards in a row so that the leftmost card is red and every second card is...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $T = TNYWR.$ Ethan places $T$ red cards and $T$ blue cards in a row so that the leftmost card is red and every second card is red. He performs a sequence of operations called replacements: in each replacement, he randomly selects a card other than the leftmost one, discards it, and moves the leftmost card to the discarded card’s position. This process is repeated until only one card remains. The probability that the final remaining card is red is $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m+n$.

Solution