Maths Olympiad Prep

Library / /61 of 87

Combinatorics Difficulty 6.7 National Olympiad Prove it Serbia

Problem:

For a sequence of nonnegative real numbers a1,a2,,aka_{1}, a_{2}, \ldots, a_{k} we say that it is embeddable in the interval [b,c][b, c] if there exist numbers x0,x1,,xkx_{0}, x_{1}, \ldots, x_{k} from the interval [b,c][b, c] such that xixi1=ai\left|x_{i}-x_{i-1}\right|=a_{i} holds for i=1,2,,ki=1,2, \ldots, k. A sequence is normed if all of its terms are not greater than 1. For a given natural number nn, prove:

a) every normed sequence of length 2n+12 n+1 is embeddable in the interval [0,212n]\left[0,2-\frac{1}{2^{n}}\right];

b) there exists a normed sequence of length 4n+34 n+3 which is not embeddable in [0,212n]\left[0,2-\frac{1}{2^{n}}\right].

Solution

Solution:

a) It suffices to prove that every normed sequence a1,a2,,a2n+1a_{1}, a_{2}, \ldots, a_{2 n+1} is embeddable in some interval of length 212n2-\frac{1}{2^{n}}. We prove the claim by induction on nn. It is true for n=0n=0; let n1n \geqslant 1. By the induction hypothesis there exists a sequence x0,x1,,x2n1[0,212n1]x_{0}, x_{1}, \ldots, x_{2 n-1} \in\left[0,2-\frac{1}{2^{n-1}}\right] such that xixi1=ai\left|x_{i}-x_{i-1}\right|=a_{i} for i=1,,2n1i=1, \ldots, 2 n-1. Without loss of generality, we shall assume that x2n1112nx_{2 n-1} \leqslant 1-\frac{1}{2^{n}}.

(1) If a2n12na_{2 n} \geqslant \frac{1}{2^{n}}, we can take x2n=x2n1+a2n[1,212n]x_{2 n}=x_{2 n-1}+a_{2 n} \in\left[1,2-\frac{1}{2^{n}}\right] and x2n+1=x2na2n+1[0,212n]x_{2 n+1}=x_{2 n}-a_{2 n+1} \in\left[0,2-\frac{1}{2^{n}}\right], whereby the sequence is embedded in the interval [0,212n]\left[0,2-\frac{1}{2^{n}}\right].

(2) If a2n<12na_{2 n}<\frac{1}{2^{n}}, we shall take x2n=x2n1a2n[12n,112n]x_{2 n}=x_{2 n-1}-a_{2 n} \in\left[-\frac{1}{2^{n}}, 1-\frac{1}{2^{n}}\right] and x2n+1=x2n+a2n+1x_{2 n+1}=x_{2 n}+a_{2 n+1}, whereby the sequence is embedded in one of the intervals [0,212n]\left[0,2-\frac{1}{2^{n}}\right] and [12n,212n1]\left[-\frac{1}{2^{n}}, 2-\frac{1}{2^{n-1}}\right].

b) Let us denote N=32n11N=3 \cdot 2^{n-1}-1. We shall prove that the sequence of length 4n14 n-1

1,11N,1,12N,1,122N,,1,12n1N,1,12n2N,1,,12N,1,11N,11,1-\frac{1}{N}, 1,1-\frac{2}{N}, 1,1-\frac{2^{2}}{N}, \ldots, 1,1-\frac{2^{n-1}}{N}, 1,1-\frac{2^{n-2}}{N}, 1, \ldots, 1-\frac{2}{N}, 1,1-\frac{1}{N}, 1

cannot be embedded in the interval (1+12N,112N)\left(-1+\frac{1}{2 N}, 1-\frac{1}{2 N}\right), from which the claim follows.

Assume the contrary. By a simple induction one proves that:

(i) x2i<12i+112N\left|x_{2 i}\right|<1-\frac{2^{i+1}-1}{2 N} and x2i+1>2i+112N\left|x_{2 i+1}\right|>\frac{2^{i+1}-1}{2 N} for i=0,,ni=0, \ldots, n;

(ii) x2i<22n+2i12N\left|x_{2 i}\right|<\frac{2^{2 n+2-i}-1}{2 N} and x2i+1>122n+2i12N\left|x_{2 i+1}\right|>1-\frac{2^{2 n+2-i}-1}{2 N} for i=n+1,,2n+1i=n+1, \ldots, 2 n+1.

Thus for x4n+3x_{4 n+3} we obtain a contradiction.

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 translated into English from sr; metadata (topic, difficulty) added by this project.