Maths Olympiad Prep

Library / /58 of 61

Algebra Difficulty 7.1 National olympiad, round 2 Prove it Ukraine

a) Prove that for any rational number α(0;1)\alpha \in (0; 1) there exists an infinite set of real numbers that satisfy the equation {x[x{x}]}=α\{x[x\{x\}]\} = \alpha and any two of them have the same fractional part.

b) Prove that for any rational number α(0;1)\alpha \in (0; 1) there exists an infinite set of real numbers that satisfy the equation {x[x{x}]}=α\{x[x\{x\}]\} = \alpha and any two of them have different fractional parts.

(The fractional part of a real number aa is given by {a}=aa\{a\} = a - \lfloor a \rfloor, where a\lfloor a \rfloor is its integer part, i.e., the greatest integer that does not exceed aa.)

Solution

a) Let α=pq\alpha = \frac{p}{q}, where p,qNp, q \in \mathbb{N}, p<qp < q. Consider y=pq+1qy = pq + \frac{1}{q}. Then all x=y+mx = y + m, where m=qnm = q^n, nNn \in \mathbb{N}, n2n \ge 2, have equal fractional parts and satisfy the given equation. Indeed, then we have:
{x}={y},m{y}N,my{y}N, \{x\} = \{y\}, \quad m\{y\} \in \mathbb{N}, \quad my\{y\} \in \mathbb{N},

\begin{align*}
x\{x\} &= (y+m)\{y\} = y\{y\} + m\{y\}, & [x\{x\}] &= [y\{y\}] + m\{y\}, \\
x[x\{x\}] &= (y+m)([y\{y\}] + m\{y\}) = y[y\{y\}] + m[y\{y\}] + my\{y\} + m^2\{y\}, & \\
\{x[x\{x\}]\} &= \{y[y\{y\}]\} = \frac{p}{q} = \alpha.
\end{align*}
b) For $\alpha = \frac{p}{q}$, $p, q \in \mathbb{N}$, $p < q$, consider $x = pqn^2 + \frac{1}{qn}$, $n \in \mathbb{N}$. Then
\begin{align*}
\{x\} &= \frac{1}{qn}, \quad x\{x\} = \left( pqn^2 + \frac{1}{qn} \right) \frac{1}{qn} = pn + \frac{1}{q^2 n^2}, \quad [x\{x\}] = pn, \\
x[x\{x\}] &= \left( pqn^2 + \frac{1}{qn} \right) pn = p^2 q n^3 + \frac{p}{q}, \quad \{x[x\{x\}]\} = \frac{p}{q} = \alpha.
\end{align*}

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 and solution reproduced as published; topic and difficulty added by this site.