On \(r\)-free integers in Beatty sequences (Q2116823)

Let \(r\geq 2\) be a fixed integer, \(\alpha>1\) be irrational with bounded partial quotients, and \(\beta\in[0,\alpha)\). In the paper under review, the authors prove that as \(x\to\infty\), the number of \(r\)-free integers of Beatty sequence \(\lfloor\alpha n+\beta\rfloor\) with \(n\leq x\) is equal to \(x/\zeta(r)+O\left(x^{(r+1)/(2r)}\log^3 x\right)\). Also, they prove that the number of consecutive square-free Beatty numbers \(\lfloor\alpha n+\beta\rfloor\) and \(\lfloor\alpha n+\beta\rfloor+1\) with \(n\leq x\) is equal to \(cx+O\left(\alpha x^{3/4+\varepsilon}\log^3 x\right)\), where \(\varepsilon>0\), \[ c=\prod_p\left(1-\frac{2}{p^2}\right), \] and the product runs over all primes.