olymmath

SIMON-MARAIS 2024 A3

  • Paper A

Let WW be a fixed positive integer. Let SS be the set of all pairs (a,b)(a, b) of positive integers such that a≠ba \neq b. For each (a,b)∈S(a, b) \in S, let m(a,b)m(a, b) be the largest integer satisfying m(a,b)≤1+na1+nbm(a, b) \leq \frac{1 + na}{1 + nb} for all integers n≥1n \geq 1.

(a) For each (a,b)∈S(a, b) \in S, prove that there exists a positive integer kk such that

m(a,b)≤1+naW+nb,m(a, b) \leq \frac{1 + na}{W + nb},

for all n≥kn \geq k.

(b) For each (a,b)∈S(a, b) \in S, let k(a,b)k(a, b) be the smallest value of kk that satisfies the condition of part (a). Determine max⁡{k(a,b)∣(a,b)∈S}\max\{k(a, b) \mid (a, b) \in S\} or prove that it does not exist.

Official text Simon Marais Mathematics Competition 2024 official paper, page 2. Quoted with source.

A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

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 simon-marais/2024/a3 · Tag H4YHM9788K · Edit this page on GitHub · Keys: j next, k previous