Maths Olympiad Prep

Library / /20 of 34

, 2014

Algebra Difficulty 5.9 AIME, harder Prove it Austria

Let ana_n be the sequence defined by some a0a_0 and the recursion
an+1=an+23n a_{n+1} = a_n + 2 \cdot 3^n
for n0n \ge 0.
Determine all rational values of a0a_0 such that
akjajk \frac{a_k^j}{a_j^k}
is an integer for all integers jj and kk with 0<j<k0 < j < k.

Solution

We have
an=a0+k=0n1(ak+1ak)=a0+k=0n123k=a0+23n131=a01+3n. a_n = a_0 + \sum_{k=0}^{n-1} (a_{k+1} - a_k) = a_0 + \sum_{k=0}^{n-1} 2 \cdot 3^k = a_0 + 2 \frac{3^n - 1}{3-1} = a_0 - 1 + 3^n.
If a0=1a_0 = 1, then an=3na_n = 3^n and
akjajk=3kj3jk=1, \frac{a_k^j}{a_j^k} = \frac{3^{kj}}{3^{jk}} = 1,
so a0=1a_0 = 1 is clearly a solution.

We now assume that a01a_0 \neq 1 and write a01=x/ya_0 - 1 = x/y with coprime integers xx and yy with y>0y > 0.
We obtain
akjajk=(xy+3k)j(xy+3j)k=(x+y3k)j(x+y3j)kykjZ. \frac{a_k^j}{a_j^k} = \frac{\left(\frac{x}{y} + 3^k\right)^j}{\left(\frac{x}{y} + 3^j\right)^k} = \frac{(x + y3^k)^j}{(x + y3^j)^k} y^{k-j} \in \mathbb{Z}.
We have gcd(x+y3j,y)=gcd(x,y)=1\text{gcd}(x + y3^j, y) = \text{gcd}(x, y) = 1, which implies that
(x+y3k)j(x+y3j)k \frac{(x + y3^k)^j}{(x + y3^j)^k}
is also an integer. This implies that
(x+3ky)kj(x+3ky)j(x+3jy)k=(x+3ky)k(x+3jy)k=(x+3kyx+3jy)k (x + 3^k y)^{k-j} \frac{(x + 3^k y)^j}{(x + 3^j y)^k} = \frac{(x + 3^k y)^k}{(x + 3^j y)^k} = \left(\frac{x + 3^k y}{x + 3^j y}\right)^k
is an integer, too. If the kkth power of a rational number is an integer, then the number itself has to be an integer. Therefore,
x+3kyx+3jy \frac{x + 3^k y}{x + 3^j y}
is an integer. We now set k=j+1k = j + 1 and write
x+3j+1yx+3jy=3+2xx+3jy. \frac{x + 3^{j+1}y}{x + 3^j y} = 3 + \frac{-2x}{x + 3^j y}.
As this is an integer by the above considerations, the second summand
2xx+3jy \frac{-2x}{x + 3^j y}
is also an integer. As y>0y > 0 by construction, the denominator is unbounded for jj \to \infty, which results in x=0x = 0, i.e., a0=1a_0 = 1.

We conclude that a0=1a_0 = 1 is the only suitable initial value. \square

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.