Maths Olympiad Prep

Library / /32 of 34

, 2010

Algebra Difficulty 7.2 National olympiad, round 2 Prove it Austria

For a positive integer nn, let fn(x)f_n(x) be defined by
fn(x)=k=1nxk. f_n(x) = \sum_{k=1}^{n} |x - k|.
Determine the solution to the inequality fn(x)<41f_n(x) < 41 for every two-digit integer nn (in decimal notation).
G. Baron, Vienna

Solution

Note first that the function fn(x)f_n(x) satisfies fn(x)=fn(n+1x)f_n(x) = f_n(n+1-x):
fn(n+1x)=k=1nn+1xk=k=1nx(n+1k)=k=1nxk=fn(x) f_n(n+1-x) = \sum_{k=1}^{n} |n+1-x-k| = \sum_{k=1}^{n} |x - (n+1-k)| = \sum_{k=1}^{n} |x-k| = f_n(x)
by reversing the order of summation. Let us first consider the case x<1x < 1: then, xk<0x-k < 0 for every k1k \ge 1 and thus
fn(x)=k=1n(kx)=n(n+1)2nx>n(n+1)2n=n(n1)21092=45>41, f_n(x) = \sum_{k=1}^{n} (k-x) = \frac{n(n+1)}{2} - nx > \frac{n(n+1)}{2} - n = \frac{n(n-1)}{2} \ge \frac{10 \cdot 9}{2} = 45 > 41,
so this case can be excluded. By symmetry (identity above), we can exclude x>nx > n as well. Thus we are left with 1xn1 \le x \le n. Suppose that x[,+1]x \in [\ell, \ell + 1] for some integer \ell with 1n11 \le \ell \le n - 1. Then xk0x - k \le 0 for k+1k \ge \ell + 1 and xk0x - k \ge 0 for kk \le \ell, and we obtain
fn(x)=k=1(xk)+k=+1n(kx)=x(+1)2+(n)(n++1)2(n)x=n(n+1)2(+1)+(2n)x. \begin{aligned} f_n(x) &= \sum_{k=1}^{\ell} (x-k) + \sum_{k=\ell+1}^{n} (k-x) = \ell x - \frac{\ell(\ell+1)}{2} + \frac{(n-\ell)(n+\ell+1)}{2} - (n-\ell)x \\ &= \frac{n(n+1)}{2} - \ell(\ell+1) + (2\ell-n)x. \end{aligned}
This shows that fn(x)f_n(x) is strictly decreasing on [,+1][\ell, \ell + 1] if <n2\ell < \frac{n}{2}, constant on [n2,n2+1][\frac{n}{2}, \frac{n}{2} + 1] (if nn is even) and strictly increasing on [,+1][\ell, \ell + 1] if >n2\ell > \frac{n}{2}. We conclude:
* If nn is even, then fn(x)f_n(x) is strictly decreasing on [1,n2][1, \frac{n}{2}], constant on [n2,n2+1][\frac{n}{2}, \frac{n}{2} + 1] and strictly increasing on [n2+1,n][\frac{n}{2} + 1, n].
* If nn is odd, then fn(x)f_n(x) is strictly decreasing on [1,n+12][1, \frac{n+1}{2}] and strictly increasing on [n+12,n][\frac{n+1}{2}, n].
We see that the minimum of fn(x)f_n(x) is always attained at m=n+12m = \lfloor \frac{n+1}{2} \rfloor. Now we can complete squares in the above to obtain
fn(m)=n(n+1)2m(m+1)+(2mn)m=n(n+1)2+m2(n+1)m=n(n+1)2+(mn+12)2(n+12)2n(n+1)2(n+12)2=n214. \begin{aligned} f_n(m) &= \frac{n(n+1)}{2} - m(m+1) + (2m-n)m = \frac{n(n+1)}{2} + m^2 - (n+1)m \\ &= \frac{n(n+1)}{2} + \left(m - \frac{n+1}{2}\right)^2 - \left(\frac{n+1}{2}\right)^2 \ge \frac{n(n+1)}{2} - \left(\frac{n+1}{2}\right)^2 = \frac{n^2-1}{4}. \end{aligned}
If n13n \ge 13, then this implies fn(x)fn(m)13214=42>41f_n(x) \ge f_n(m) \ge \frac{13^2-1}{4} = 42 > 41 for all xx, so that there is no solution. It remains to consider n{10,11,12}n \in \{10, 11, 12\}.
* For n=10n = 10, we obtain from above that
f10(32)=552832=41 f_{10}\left(\frac{3}{2}\right) = 55 - 2 - 8 \cdot \frac{3}{2} = 41
and by the symmetry property f10(192)=41f_{10}\left(\frac{19}{2}\right) = 41. In view of our monotonicity considerations, f10(x)41f_{10}(x) \ge 41 for x32x \le \frac{3}{2} and x192x \ge \frac{19}{2} and f10(x)<41f_{10}(x) < 41 on the remaining interval. So we find that the solution set in this case is (32,192)\left(\frac{3}{2}, \frac{19}{2}\right).
* For n=11n = 11, we have
f11(197)=6667197=41 f_{11}\left(\frac{19}{7}\right) = 66 - 6 - 7 \cdot \frac{19}{7} = 41
and f11(657)=41f_{11}\left(\frac{65}{7}\right) = 41 by symmetry. The same argument as before shows that the solution set is (197,657)\left(\frac{19}{7}, \frac{65}{7}\right) in this case.
* For n=12n = 12, we have
f12(174)=78204174=41 f_{12}\left(\frac{17}{4}\right) = 78 - 20 - 4 \cdot \frac{17}{4} = 41
and f12(354)=41f_{12}\left(\frac{35}{4}\right) = 41 by symmetry. Hence we obtain the solution set (174,354)\left(\frac{17}{4}, \frac{35}{4}\right) in this case.
Let us summarize the solutions:
* 32<x<192\frac{3}{2} < x < \frac{19}{2} for n=10n = 10,
* 197<x<657\frac{19}{7} < x < \frac{65}{7} for n=11n = 11,
* 174<x<354\frac{17}{4} < x < \frac{35}{4} for n=12n = 12,
* no solutions if n13n \ge 13.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.