Maths Olympiad Prep

Library / /52 of 121

Algebra Difficulty 5.9 AIME, harder Prove it India

Problem:
Let x1x_{1} be a given positive integer. A sequence xnn=1=x1,x2,x3,\langle x_{n}\rangle_{n=1}^{\infty} = \langle x_{1}, x_{2}, x_{3}, \cdots \rangle of positive integers is such that xnx_{n}, for n2n \geq 2, is obtained from xn1x_{n-1} by adding some nonzero digit of xn1x_{n-1}. Prove that
(a) the sequence has an even number;
(b) the sequence has infinitely many even numbers.

Solution

Solution:
(a) Let us assume that there are no even numbers in the sequence. This means that xn+1x_{n+1} is obtained from xnx_{n}, by adding a nonzero even digit of xnx_{n} to xnx_{n}, for each n1n \geq 1.
Let EE be the left most even digit in x1x_{1} which may be taken in the form
x1=O1O2OkED1D2Dl x_{1} = O_{1} O_{2} \cdots O_{k} E D_{1} D_{2} \cdots D_{l}
where O1,O2,,OkO_{1}, O_{2}, \ldots, O_{k} are odd digits (k0)(k \geq 0); D1,D2,,Dl1D_{1}, D_{2}, \ldots, D_{l-1} are even or odd; and DlD_{l} odd, l1l \geq 1.
Since each time we are adding at least 2 to a term of the sequence to get the next term, at some stage, we will have a term of the form
xr=O1O2OkE9999F x_{r} = O_{1} O_{2} \cdots O_{k} E 999 \cdots 9 F
where F=3,5,7F = 3, 5, 7 or 99. Now we are forced to add EE to xrx_{r} to get xr+1x_{r+1}, as it is the only even digit available. After at most four steps of addition, we see that some next term is of the form
xs=O1O2OkG000M x_{s} = O_{1} O_{2} \cdots O_{k} G 000 \cdots M
where GG replaces EE of xrx_{r}, G=E+1G = E+1, M=1,3,5M = 1, 3, 5, or 77. But xsx_{s} has no nonzero even digit contradicting our assumption. Hence the sequence has some even number as its term.

(b) If there are only finitely many even terms and xtx_{t} is the last term, then the sequence xnn=t+1=xt+1,xt+2,\langle x_{n}\rangle_{n=t+1}^{\infty} = \langle x_{t+1}, x_{t+2}, \ldots \rangle is obtained in a similar manner and hence must have an even term by (a), a contradiction. Thus xnn=1\langle x_{n}\rangle_{n=1}^{\infty} has infinitely many even terms.

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.