Skip to content
Preprint

On integers $n$ relatively prime to $\lfloor \alpha n^2\rfloor$

Nov 2026 · 0 citations · 11 references
Mathematics

Abstract

For $\alpha\in\mathbb{R}$ and $k\in\mathbb{N}$, let $S_{\alpha,k}(x):=\#\{n\in\mathbb N:n\le x,\ \gcd(n,\lfloor\alpha n^k\rfloor)=1\}$. Roth conjectured, and Watson proved, that $S_{\alpha,1}(x)\sim 6x/\pi^2$ for every irrational $\alpha$. Whether the same asymptotic holds for every fixed $k\ge2$ is a special case of a question of Bergelson and Richter, and was asked explicitly by Champagne. We answer this for $k=2$, with no Diophantine condition on $\alpha$: for every irrational $\alpha$, $S_{\alpha,2}(x)\sim x/\zeta(2)$ as $x\to\infty$. More precisely, for every fixed $A>0$ we obtain an error term $O_A(x/(\log q(x))^A)$, where $q(x)$ is the largest continued-fraction convergent denominator of $\alpha$ not exceeding $x$. The proof sieves $S_{\alpha,2}(x)$ over divisors, splitting at the parameter $R=q(x)^{1/8}$. Divisors larger than $R$ are handled by reducing the condition $d\mid\gcd(n,\lfloor\alpha n^2\rfloor)$ to M\"obius sums over arithmetic progressions and applying Zhan's uniform estimate for exponential sums twisted by $\mu(n)$ over short intervals; divisors at most $R$ are handled instead through the Erd\H{o}s-Tur\'an inequality together with Weyl-type bounds for quadratic exponential sums of the form $\sum e(\beta n^2)$.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.