Maths Olympiad Prep

Track / Stage 6 / 159 of 400 #1639 of 2444

Problem 1639

National Olympiad, first round
Algebra Difficulty 6.2 Prove it HMMT February · United States · 2015

Let pp be a real number and c0c \neq 0 an integer such that
c0.1<xp(1(1+x)101+(1+x)10)<c+0.1 c-0.1 < x^{p} \left( \frac{1-(1+x)^{10}}{1+(1+x)^{10}} \right) < c+0.1
for all (positive) real numbers xx with 0<x<101000 < x < 10^{-100}. (The exact value 1010010^{-100} is not important. You could replace it with any "sufficiently small number".)
Find the ordered pair (p,c)(p, c).

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:
Answer: (1,5)(-1,-5) This is essentially a problem about limits, but phrased concretely in terms of "small numbers" (like 0.1 and 1010010^{-100}).

We are essentially studying the rational function f(x):=1(1+x)101+(1+x)10=10x+O(x2)2+O(x)f(x) := \frac{1-(1+x)^{10}}{1+(1+x)^{10}} = \frac{-10x + O(x^{2})}{2 + O(x)}, where the "big-O" notation simply makes precise the notion of "error terms".

Intuitively, f(x)10x2=5xf(x) \approx \frac{-10x}{2} = -5x for "small nonzero xx". (We could easily make this more precise if we wanted to, by specifying the error terms more carefully, but it's not so important.) So g(x):=xpf(x)5xp+1g(x) := x^{p} f(x) \approx -5 x^{p+1} for "small nonzero xx".

- If p+1>0p+1 > 0, gg will approach 00 ("get very small") as xx approaches 00 (often denoted x0x \rightarrow 0), so there's no way it can stay above the lower bound c0.1c-0.1 for all small nonzero xx.

- If p+1<0p+1 < 0, gg will approach -\infty ("get very large in the negative direction") as x0x \rightarrow 0, so there's no way it can stay below the upper bound c+0.1c+0.1 for all small nonzero xx.

- If p+1=0p+1 = 0, g5g \approx -5 becomes approximately constant as x0x \rightarrow 0. Since cc is an integer, we must have c=5c = -5 (as 5-5 is the only integer within 0.10.1 of 5-5).

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.