Olympiad Maths Prep

Track / Stage 6 / 295 of 400 #1295 of 2000

Problem 1295

National olympiad, first round
Number theory Difficulty 6.5 Find the answer

21. N4 (FRA) For any positive integer x0x_{0}, three sequences {xn},{yn}\left\{x_{n}\right\},\left\{y_{n}\right\}, and {zn}\left\{z_{n}\right\} are defined as follows: (i) y0=4y_{0}=4 and z0=1z_{0}=1; (ii) if xnx_{n} is even for n0,xn+1=xn2,yn+1=2ynn \geq 0, x_{n+1}=\frac{x_{n}}{2}, y_{n+1}=2 y_{n}, and zn+1=znz_{n+1}=z_{n}; (iii) if xnx_{n} is odd for n0,xn+1=xnyn2zn,yn+1=ynn \geq 0, x_{n+1}=x_{n}-\frac{y_{n}}{2}-z_{n}, y_{n+1}=y_{n}, and zn+1=z_{n+1}= yn+zny_{n}+z_{n}. The integer x0x_{0} is said to be good if xn=0x_{n}=0 for some n1n \geq 1. Find the number of good integers less than or equal to 1994.

Official solution

21. Note first that yn=2k(k2) y_{n} = 2^k (k \geq 2) and zk1(mod4) z_{k} \equiv 1 \pmod{4} for all n n , so if xn x_{n} is odd, xn+1 x_{n+1} will be even. Further, it is shown by induction on n n that yn>zn y_{n} > z_{n} when xn1 x_{n-1} is even and 2yn>zn>yn 2 y_{n} > z_{n} > y_{n} when xn1 x_{n-1} is odd. In fact, n=1 n = 1 is the trivial case, while if it holds for n1 n \geq 1 , then yn+1=2yn>zn=zn+1 y_{n+1} = 2 y_{n} > z_{n} = z_{n+1} if xn x_{n} is even, and 2yn+1=2yn>yn+zn=zn+1 2 y_{n+1} = 2 y_{n} > y_{n} + z_{n} = z_{n+1} if xn x_{n} is odd (since then xn1 x_{n-1} is even). If x1=0 x_{1} = 0 , then x0=3 x_{0} = 3 is good. Suppose xn=0 x_{n} = 0 for some n2 n \geq 2 . Then xn1 x_{n-1} is odd and xn2 x_{n-2} is even, so that yn1>zn1 y_{n-1} > z_{n-1} . We claim that a pair (yn1,zn1) \left(y_{n-1}, z_{n-1}\right) , where 2k=yn1>zn1>0 2^k = y_{n-1} > z_{n-1} > 0 and zn11(mod4) z_{n-1} \equiv 1 \pmod{4} , uniquely determines x0=f(yn1,zn1) x_{0} = f\left(y_{n-1}, z_{n-1}\right) . We see that xn1=12yn1+zn1 x_{n-1} = \frac{1}{2} y_{n-1} + z_{n-1} , and define (xk,yk,zk) \left(x_{k}, y_{k}, z_{k}\right) backwards as follows, until we get (yk,zk)=(4,1) \left(y_{k}, z_{k}\right) = (4,1) . If yk>zk y_{k} > z_{k} , then xk1 x_{k-1} must have been even, so we define (xk1,yk1,zk1)=(2xk,yk/2,zk) \left(x_{k-1}, y_{k-1}, z_{k-1}\right) = \left(2 x_{k}, y_{k} / 2, z_{k}\right) ; otherwise xk1 x_{k-1} must have been odd, so we put (xk1,yk1,zk1)=(xkyk/2+zk,yk,zkyk) \left(x_{k-1}, y_{k-1}, z_{k-1}\right) = \left(x_{k} - y_{k} / 2 + z_{k}, y_{k}, z_{k} - y_{k}\right) . We eventually arrive at (y0,z0)=(4,1) \left(y_{0}, z_{0}\right) = (4,1) and a good integer x0=f(yn1,zn1) x_{0} = f\left(y_{n-1}, z_{n-1}\right) , as claimed. Thus for example (yn1,zn1)=(64,61) \left(y_{n-1}, z_{n-1}\right) = (64,61) implies xn1=93 x_{n-1} = 93 , (xn2,yn2,zn2)=(186,32,61) \left(x_{n-2}, y_{n-2}, z_{n-2}\right) = (186,32,61) etc., and x0=1953 x_{0} = 1953 , while in the case of (yn1,zn1)=(128,1) \left(y_{n-1}, z_{n-1}\right) = (128,1) we get x0=2080 x_{0} = 2080 . Note that y>yf(y,z)>f(y,z) y' > y \Rightarrow f\left(y', z'\right) > f(y, z) and z>zf(y,z)>f(y,z) z' > z \Rightarrow f\left(y, z'\right) > f(y, z) . Therefore there are no y,z y, z for which 1953<f(y,z)<2080 1953 < f(y, z) < 2080 . Hence all good integers less than or equal to 1994 are given as f(y,z),y=2k64 f(y, z), y = 2^k \leq 64 and 0<z1(mod4) 0 < z \equiv 1 \pmod{4} , and the number of such (y,z) (y, z) equals 1+2+4+8+16=31 1 + 2 + 4 + 8 + 16 = 31 . So the answer is 31.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.