Maths Olympiad Prep

Library / /6 of 16

Algebra Difficulty 5.7 AIME, harder Prove it Bulgaria

Problem:

Consider the equations
32x+32x+2=2x+59x+1 3^{2x+3} - 2^{x+2} = 2^{x+5} - 9^{x+1}
and
a52x+a15x=1 a \cdot 5^{2x} + |a-1| 5^{x} = 1
where aa is a real number.

a) Solve the equation (1).

b) Find the values of aa such that the equations (1) and (2) are equivalent.

Solution

Solution:

a) The equation (1) can be written as 9x=2x9^{x} = 2^{x}, i.e. (92)x=1\left(\frac{9}{2}\right)^{x} = 1 and x=0x = 0.

b) We plug the only solution x=0x = 0 of (1) in (2) and obtain a1=1aa1|a-1| = 1-a \Longleftrightarrow a \leq 1. In this case 00 is a solution of (2) and we have to decide when (2) has no other solution(s).

Set 5x=t5^{x} = t, t>0t > 0. Then we have to find all a1a \leq 1 such that the equation
at2+(1a)t1=0 a t^{2} + (1-a) t - 1 = 0
has not positive roots different from 11. For a=0a = 0 the only root of (3) is t=1t = 1 and the condition is satisfied. For a0a \neq 0 the roots of (3) are 11 and 1a-\frac{1}{a}. Therefore the condition is satisfied if and only if 1a=1-\frac{1}{a} = 1 or 1a<0-\frac{1}{a} < 0. Hence a=1a = -1 or a>0a > 0 and we conclude that a[0,1]{1}a \in [0, 1] \cup \{-1\}.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.