2013 Canadian MO Problems/Problem 4

Revision as of 00:18, 27 November 2023 by Tomasdiaz (talk | contribs) (Created page with "==Problem == Let <math>n</math> be a positive integer. For any positive integer <math>j</math> and positive real number <math>r</math>, define <cmath> f_j(r) =\min (jr, n)+\m...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be a positive integer. For any positive integer $j$ and positive real number $r$, define \[f_j(r) =\min (jr, n)+\min\left(\frac{j}{r}, n\right),\text{ and }g_j(r) =\min (\lceil jr\rceil, n)+\min\left(\left\lceil\frac{j}{r}\right\rceil, n\right),\] where $\lceil x\rceil$ denotes the smallest integer greater than or equal to $x$. Prove that \[\sum_{j=1}^n f_j(r)\leq n^2+n\leq \sum_{j=1}^n g_j(r)\] for all positive real numbers $r$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.