Let $a$ and $b$ be two square-free, distinct natural numbers. Show that there exist $c>0$ such that \[ \left | \{n\sqrt{a}\}-\{n\sqrt{b}\} \right |>\frac{c}{n^3}\] for every positive integer $n$.
Problem
Source: Romania TST 2013 Day 3 Problem 1
Tags: inequalities, algebra, polynomial, absolute value, triangle inequality, number theory unsolved, number theory
22.01.2015 22:42
22.01.2015 23:43
The number $\lambda = \sqrt{a} - \sqrt{b}$ is an algebraic integer of degree $4$; its minimal polynomial is \[\prod (x \pm \sqrt{a} \pm \sqrt{b}) = x^4 - 2(a+b)x^2 + (a-b)^2 \in \mathbb{Z}[x].\] The condition on $a,b$ to be square-free is present only in order to ensure that $\sqrt{ab}$ is irrational, thus the degree of $\lambda$ is $4$. The Liouville approximation theorem states that for an algebraic integer $\lambda$ of degree $d$ there exists a real positive constant $c$ such that \[\displaystyle \left | \lambda - \dfrac {m} {n} \right | > \dfrac {c} {n^d},\] for any positive integers $m,n$, thus in our case $\displaystyle \left | n\lambda - m \right | > \dfrac {c} {n^3}$, i.e. $\min \{\{n\lambda\}, 1 - \{n\lambda\}\} > \dfrac {c} {n^3}$. But this is clearly equivalent with $ \left | \{n\sqrt{a}\} - \{n\sqrt{b}\} \right | > \dfrac {c} {n^3}. \quad \square$ From the Thue-Siegel-Roth approximation theorem follows even more, namely that for any $\varepsilon > 0$ there exists a real positive constant $c(\varepsilon)$ such that \[\displaystyle \left | \lambda - \dfrac {m} {n} \right | > \dfrac {c(\varepsilon)} {n^{2+\varepsilon}},\] and then $\displaystyle \left | n\lambda - m \right | > \dfrac {c(\varepsilon)} {n^{1+\varepsilon}}$. On the other hand, the Dirichlet approximation theorem states that the equation \[\displaystyle \left | \lambda - \dfrac {m} {n} \right | < \dfrac {1} {n^2}\] is satisfied for infinitely many positive integers $m,n$, thus the exponent $2+\varepsilon$ is best possible. I wondered what was the purpose of this question ... Although several people tried to convince me of its benefit, I'm still reserved upon it.
25.12.2021 07:58
hard problem for p1.