Maths Olympiad Prep

Library / Junior Balkan MO /42 of 51

Junior Balkan MO

Algebra Difficulty 6.8 National Olympiad Prove it JBMO

Problem:

Let nn (n≥1n \geq 1) be an integer. Consider the equation
2⋅⌊12x⌋−n+1=(n+1)(1−nx) 2 \cdot \left\lfloor \frac{1}{2x} \right\rfloor - n + 1 = (n+1)(1 - n x)
where xx is the unknown real variable.

a. Solve the equation for n=8n=8.

b. Prove that there exists an integer nn for which the equation has at least 2021 solutions. (For any real number yy by ⌊y⌋\lfloor y \rfloor we denote the largest integer mm such that m≤ym \leq y.)

Solution

Solution:

Let k=⌊12x⌋k = \left\lfloor \frac{1}{2x} \right\rfloor, k∈Zk \in \mathbb{Z}.

a. For n=8n=8, the equation becomes
k=⌊12x⌋=8−36x⇒x≠0 and x=8−k36 k = \left\lfloor \frac{1}{2x} \right\rfloor = 8 - 36x \Rightarrow x \neq 0 \text{ and } x = \frac{8 - k}{36}
Since x≠0x \neq 0, we have k≠8k \neq 8, and the last relation implies k=⌊12x⌋=⌊188−k⌋k = \left\lfloor \frac{1}{2x} \right\rfloor = \left\lfloor \frac{18}{8 - k} \right\rfloor. Checking signs, we see that 0<k<80 < k < 8. By direct verification, we find the solutions k=3k = 3 (hence x=536x = \frac{5}{36}) and k=4k = 4 (hence x=19x = \frac{1}{9}).

b. From the given equation we have x≠0x \neq 0 and x=2(n−k)n(n+1)x = \frac{2(n - k)}{n(n+1)}. Therefore, k≠nk \neq n and k=⌊12x⌋=⌊n(n+1)4(n−k)⌋k = \left\lfloor \frac{1}{2x} \right\rfloor = \left\lfloor \frac{n(n+1)}{4(n - k)} \right\rfloor. Again, checking signs we see that 0≤k<n0 \leq k < n. The last equation implies
k≤n(n+1)4(n−k)<k+1⇒{(2k−n)2+n≥0(2k+1−n)2<n+1⇒⇒n−1−n+12<k<n−1+n+12 \begin{gathered} k \leq \frac{n(n+1)}{4(n-k)} < k+1 \Rightarrow \left\{\begin{array}{l} (2k - n)^2 + n \geq 0 \\ (2k + 1 - n)^2 < n+1 \end{array} \Rightarrow \right. \\ \quad \Rightarrow \frac{n-1-\sqrt{n+1}}{2} < k < \frac{n-1+\sqrt{n+1}}{2} \end{gathered}
Conversely, if k∈Zk \in \mathbb{Z} satisfies (2) and 0<k<n0 < k < n, then x=2(n−k)n(n+1)x = \frac{2(n - k)}{n(n+1)} is a solution to the given equation. It remains to note that choosing nn such that n+1>2021\sqrt{n+1} > 2021 ensures that there exist at least 2021 integer values of kk which satisfy (2).

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.