Maths Olympiad Prep

Library / /4 of 8

Algebra Difficulty 7.9 National olympiad, round 2 Prove it Balkan Mathematical Olympiad

Determine all natural numbers nn such that the inequality
xn+2x+14x2 x^n + 2x + 1 \ge 4x^2
holds for every x>0x > 0.

Solutions — 4

Solution 1

Suppose that nn is a solution to the problem. The polynomial
P(x)=xn4x2+2x+1 P(x) = x^n - 4x^2 + 2x + 1
clearly has a root at 11. Therefore we may write P(x)=(x1)Q(x)P(x) = (x - 1)Q(x) for some polynomial QQ. Since P(x)0P(x) \ge 0 for x>0x > 0, the polynomial QQ changes sign at 11 and so Q(1)=0Q(1) = 0. Calculating
Q(x)=P(x)x1=xn1x14x22x2x1=(1+x++xn1)(4x+2) Q(x) = \frac{P(x)}{x-1} = \frac{x^n - 1}{x-1} - \frac{4x^2 - 2x - 2}{x-1} = (1 + x + \dots + x^{n-1}) - (4x + 2)
we see that Q(1)=n6Q(1) = n - 6 and hence n=6n = 6.

Conversely, let n=6n = 6. Note that Q(x)=(x1)R(x)Q(x) = (x - 1)R(x), where RR is a polynomial given by:
R(x)=x4+2x3+3x2+4x+1 R(x) = x^4 + 2x^3 + 3x^2 + 4x + 1
Since P(x)=(x1)2R(x)P(x) = (x - 1)^2 R(x) and R(x)0R(x) \ge 0 for x>0x > 0, we indeed have that P(x)0P(x) \ge 0 for x>0x > 0. It follows that n=6n = 6 is a solution, and thus the only solution, to the problem.

Solution 2

Let nn be a solution to the problem. Consider the function P:(0,+)RP : (0, +\infty) \to \mathbb{R}, defined by P(x)=xn4x2+2x+1P(x) = x^n - 4x^2 + 2x + 1 for every x>0x > 0. Since P(x)0P(x) \ge 0 for every x>0x > 0 and P(1)=0P(1) = 0, it follows that the function PP attains its minimum at x=1x = 1. Since this is also a local minimum and PP is differentiable, we have P(1)=0P'(1) = 0. Therefore, P(1)=n8+2=0P'(1) = n - 8 + 2 = 0. Hence, n=6n = 6 is the only possible value that can be a solution to the problem. On the other hand, for x>0x > 0, using the AM-GM inequality, we have
x6+x+x+14x6xx14=4x2 x^6 + x + x + 1 \ge 4\sqrt[4]{x^6 \cdot x \cdot x \cdot 1} = 4x^2
This proves that n=6n = 6 is the only solution to the problem.

Solution 3

We shall prove that the only solution is n=6n = 6.
The given condition is equivalent to P(x)0P(x) \ge 0 for all x>0x > 0, where P(x)=xn4x2+2x+1P(x) = x^n - 4x^2 + 2x + 1. Using elementary transformations, for n>2n > 2, we have:
P(x)=xn14x2+2x+2=(x1)(xn1+xn2++x+1)(x1)(4x+2)==(x1)(xn1+xn2++x23x1)=(x1)(xn11+xn21++x213x+3+n6)==(x1)((x1)(xn2+2xn3+3xn4++(n2)x+n5)+n6)==(x1)2(xn2+2xn3+3xn4++(n2)x+n5)+(n6)(x1). \begin{align*} P(x) &= x^n - 1 - 4x^2 + 2x + 2 = (x-1)(x^{n-1} + x^{n-2} + \dots + x + 1) - (x-1)(4x+2) = \\ &= (x-1)(x^{n-1} + x^{n-2} + \dots + x^2 - 3x - 1) = (x-1)(x^{n-1} - 1 + x^{n-2} - 1 + \dots + x^2 - 1 - 3x + 3 + n - 6) = \\ &= (x-1)\left((x-1)(x^{n-2} + 2x^{n-3} + 3x^{n-4} + \dots + (n-2)x + n - 5) + n - 6\right) = \\ &= (x-1)^2(x^{n-2} + 2x^{n-3} + 3x^{n-4} + \dots + (n-2)x + n - 5) + (n-6)(x-1). \tag{P} \end{align*}
From (P), since for n=6n = 6 and x>0x > 0 we have Q(x)>0Q(x) > 0, it follows that n=6n = 6 is one solution. Since the polynomial Q(x)Q(x) has all positive coefficients (except possibly the constant term), we have Q(113n)<Q(1)=n2n82Q(1 - \frac{1}{3n}) < Q(1) = \frac{n^2-n-8}{2}, and based on (P), for n7n \ge 7, it holds that
P(113n)=Q(113n)9n2n63n<Q(1)9n2n63n=5n(7n)818n2<0. P\left(1 - \frac{1}{3n}\right) = \frac{Q\left(1 - \frac{1}{3n}\right)}{9n^2} - \frac{n-6}{3n} < \frac{Q(1)}{9n^2} - \frac{n-6}{3n} = \frac{5n(7-n) - 8}{18n^2} < 0.
This shows that the numbers n7n \ge 7 are not solutions to the problem. On the other hand, for 1n51 \le n \le 5, we have
P(1.1)1.1541.12+21.1+1=0.02949<0, P(1.1) \le 1.1^5 - 4 \cdot 1.1^2 + 2 \cdot 1.1 + 1 = -0.02949 < 0,
so the numbers 1n51 \le n \le 5 are also not solutions.

Solution 4

Let P(x)=xn+2x+14x2P(x) = x^n + 2x + 1 - 4x^2, we want to check if P(x)0P(x) \ge 0 holds for all x>0x > 0. If n=1n = 1 substituting x=2x = 2 yields P(x)=11<0P(x) = -11 < 0, meaning that n=1n = 1 cannot be our solution. From now on, assume that n2n \ge 2, and substitute x=1+tx = 1 + t.
Using the binomial theorem we obtain that P(1+t)=(1+t)n+2(1+t)4(1+t)2=(n6)t4t2+k=2n(nk)tk(n6)t+k=2n(nk)tkP(1+t) = (1+t)^n + 2(1+t) - 4(1+t)^2 = (n-6)t - 4t^2 + \sum_{k=2}^n \binom{n}{k} t^k \le (n-6)t + \sum_{k=2}^n \binom{n}{k} t^k. It is trivially true for k2k \ge 2 that (nk)tk<nktk\binom{n}{k} t^k < n^k |t|^k, which implies P(1+t)<(n6)t+(nt)2k=0n2(nt)kP(1+t) < (n-6)t + (nt)^2 \sum_{k=0}^{n-2} (n|t|)^k. Utilizing the identity that for x1x \ne 1 we have that k=0mxk=1xm+11x\sum_{k=0}^m x^k = \frac{1-x^{m+1}}{1-x} we obtain that P(1+t)<(n6)t+(nt)21nn1tn11nt=t(n6+tn21nn1tn11nt)P(1+t) < (n-6)t + (nt)^2 \frac{1-n^{n-1}|t|^{n-1}}{1-n|t|} = t(n-6 + tn^2 \frac{1-n^{n-1}|t|^{n-1}}{1-n|t|}).
If n<6n < 6, then let t=1n3t = \frac{1}{n^3}, plugging this in we obtain P(1+1n3)<1n3(n6+11n2n2n1n)P\left(1 + \frac{1}{n^3}\right) < \frac{1}{n^3} \left(n - 6 + \frac{1-\frac{1}{n^2n-2}}{n-\frac{1}{n}}\right). Now since n<6n < 6 and nNn \in \mathbb{N}, we have that n61n - 6 \le -1. On the other hand, we know that 11n2n2<1<32n1n1 - \frac{1}{n^2n-2} < 1 < \frac{3}{2} \le n - \frac{1}{n} for n2n \ge 2, implying that 11n2n2n1n<1\frac{1-\frac{1}{n^2n-2}}{n-\frac{1}{n}} < 1. Therefore the expression in the parenthesis is negative, while 1n3>0\frac{1}{n^3} > 0, meaning that the whole expression is negative, or P(1+1n3)<0P\left(1 + \frac{1}{n^3}\right) < 0, meaning that we found a negative value for P(x)P(x) for x=1+1n3>0x = 1 + \frac{1}{n^3} > 0. Therefore no n{2,3,4,5}n \in \{2, 3, 4, 5\} can be a solution.
If n>6n > 6, then let t=1n3t = -\frac{1}{n^3}. Similarly to the case n<6n < 6, we obtain that P(11n3)<1n3(n6+11n2n2n1n)P(1 - \frac{1}{n^3}) < -\frac{1}{n^3} \left(n - 6 + \frac{1 - \frac{1}{n^2n-2}}{n - \frac{1}{n}}\right). Note that n61n - 6 \ge 1, and it still holds that 11n2n2n1n<1\frac{1 - \frac{1}{n^2n-2}}{n - \frac{1}{n}} < 1 using the same arguments. Therefore, the expression in the parenthesis is positive, while 1n3<0-\frac{1}{n^3} < 0, meaning that P(11n3)<0P\left(1 - \frac{1}{n^3}\right) < 0, and since for n>6n > 6 we have 11n3>01 - \frac{1}{n^3} > 0, we again found a negative point of our polynomial for some positive input.
Therefore, the only case left is when n=6n = 6. For this take x6+x+x+14x2x^6 + x + x + 1 \ge 4x^2 using AM-GM. Therefore, the only solution is n=6n = 6.

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.