Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /217 of 275

Romanian Mathematical Olympiad

Algebra Difficulty 6.4 National Olympiad Prove it Romania

For any integer n≥2n \ge 2 denote by AnA_n the set of solutions of the equation
x=⌊x2⌋+⌊x3⌋+⋯+⌊xn⌋. x = \lfloor \frac{x}{2} \rfloor + \lfloor \frac{x}{3} \rfloor + \dots + \lfloor \frac{x}{n} \rfloor.
a) Determine the set A2∪A3A_2 \cup A_3.
b) Prove that the set A=⋃n≥2AnA = \bigcup_{n \ge 2} A_n is finite and find max⁡A\max A.

Solution

Notice that An⊂ZA_n \subset \mathbb{Z} for all n∈Nn \in \mathbb{N}, n≥2n \ge 2.

a) The elements of A2A_2 satisfy the inequalities x−2<2x≤xx - 2 < 2x \leq x. By inspection, we obtain A2={−1,0}A_2 = \{-1, 0\}. The elements of A3A_3 satisfy the inequalities 5x−12<6x≤5x5x - 12 < 6x \leq 5x. By inspection, we have A3={−7,−5,−4,−3,−2,0}A_3 = \{-7, -5, -4, -3, -2, 0\}, so A2∪A3={−7,−5,−4,−3,−2,−1,0}A_2 \cup A_3 = \{-7, -5, -4, -3, -2, -1, 0\}.

b) For n≥4n \ge 4 and x∈Anx \in A_n we have x≤(12+13+⋯+1n)xx \le \left(\frac{1}{2} + \frac{1}{3} + \cdots + \frac{1}{n}\right) x.
From 12+13+⋯+1n>1\frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n} > 1 we obtain x≥0x \ge 0.
For x,n∈Zx, n \in \mathbb{Z} and n≥2n \ge 2 we get ⌊xn⌋≥x−(n−1)n\lfloor \frac{x}{n} \rfloor \ge \frac{x - (n - 1)}{n}. Therefore, if n≥4n \ge 4 and x∈Anx \in A_n, then
x≥⌊x2⌋+⌊x3⌋+⌊x4⌋≥x−12+x−23+x−34, x \ge \lfloor \frac{x}{2} \rfloor + \lfloor \frac{x}{3} \rfloor + \lfloor \frac{x}{4} \rfloor \ge \frac{x-1}{2} + \frac{x-2}{3} + \frac{x-3}{4},
implying x≤23x \le 23. Hence the set AA is upper bounded.
Because A⊂{−5,−4,…,23}A \subset \{-5, -4, \dots, 23\} and 23∈A423 \in A_4, then max⁡A=23\max A = 23.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.