Maths Olympiad Prep

Library / /65 of 115

Algebra Difficulty 7.4 National olympiad, round 2 Find the answer

For each integer n2n\ge 2 , determine, with proof, which of the two positive real numbers aa and bb satisfying an=a+1,b2n=b+3aa^n=a+1,\qquad b^{2n}=b+3a is larger.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Solution 1
Square and rearrange the first equation and also rearrange the second. a2na=a2+a+1b2nb=3a\begin{align} a^{2n}-a&=a^2+a+1\\ b^{2n}-b&=3a \end{align} It is trivial that (a1)2>0\begin{align*} (a-1)^2 > 0 \tag{3} \end{align*} since a1a-1 clearly cannot equal 00 (Otherwise an=11+1a^n=1\neq 1+1 ). Thus a2+a+1>3aa2na>b2nb\begin{align*} a^2+a+1&>3a \tag{4}\\ a^{2n}-a&>b^{2n}-b \tag{5} \end{align*} where we substituted in equations (1) and (2) to achieve (5). Notice that from an=a+1a^{n}=a+1 we have a>1a>1 . Thus, if b>ab>a , then b2n11>a2n11b^{2n-1}-1>a^{2n-1}-1 . Since a>1a2n11>0a>1\Rightarrow a^{2n-1}-1>0 , multiplying the two inequalities yields b2nb>a2nab^{2n}-b>a^{2n}-a , a contradiction, so a>ba> b . However, when nn equals 00 or 11 , the first equation becomes meaningless, so we conclude that for each integer n2n\ge 2 , we always have a>ba>b .
Solution 2
Define f(x)=xnx1f(x)=x^n-x-1 and g(x)=x2nx3ag(x)=x^{2n}-x-3a . By Descarte's Rule of Signs, both polynomials' only positive roots are aa and bb , respectively. With the Intermediate Value Theorem and the fact that f(1)=1f(1)=-1 and f(2)=2n3>0f(2)=2^n-3>0 , we have a(1,2)a\in(1,2) .
Thus, 3a(6,3)-3a\in(-6,-3) , which means that g(1)=3a<0g(1)=-3a<0 . Also, we find that g(a)=a2n4ag(a)=a^{2n}-4a . All that remains to prove is that g(a)>0g(a)>0 , or a2n4a>0a^{2n}-4a>0 . We can then conclude that bb is between 11 and aa from the Intermediate Value Theorem. From the first equation given, a2n=(a+1)2=a2+2a+1a^{2n}=(a+1)^2=a^2+2a+1 . Subtracting 4a4a gives us a22a+1>0a^2-2a+1>0 , which is clearly true, as a1a\neq1 . Therefore, we conclude that 1<b<a<21<b<a<2 .

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.