2025 SSMO Relay Round 3 Problems/Problem 3

Revision as of 11:44, 9 September 2025 by Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> The numbers <math>1</math> and <math>2</math> are written on a board. Every second, if the numbers currently on the board are <math>x<...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $T = TNYWR.$ The numbers $1$ and $2$ are written on a board. Every second, if the numbers currently on the board are $x$ and $y,$ the number $x+y$ is written, and one of $x$ or $y$ is erased. After a finite number of seconds, the larger number on the board is $\left\lfloor\sqrt{T}\right\rfloor$. How many possible values can the smaller number take?

Solution