2025 SSMO Relay Round 2 Problems/Problem 3

Revision as of 11:43, 9 September 2025 by Pinkpig (talk | contribs) (Created page with "==Problem== Let <math>T = TNYWR.</math> Define a \textit{multiplicative partition} of a positive integer <math>n</math> as the value of a product <math>a_1a_2\cdots a_k,</mat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $T = TNYWR.$ Define a \textit{multiplicative partition} of a positive integer $n$ as the value of a product $a_1a_2\cdots a_k,$ where $a_1+a_2+\cdots + a_k = n$ and every $a_i$ is a positive integer. Let $f(x)$ denote the maximal possible value of a multiplicative partition of $x$. If the sum of all possible values of $\frac{f\left(x+\left\lfloor\sqrt{T}\right\rfloor\right)}{f(x)}$ for integers $x>1$ can be expressed as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Solution