Consecutive generalized \(r\)-free integers in Beatty sequences (Q2679277)

From MaRDI portal
Revision as of 17:16, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Consecutive generalized \(r\)-free integers in Beatty sequences
scientific article

    Statements

    Consecutive generalized \(r\)-free integers in Beatty sequences (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2023
    0 references
    Let \(r \ge 2\) be a fixed integer. A positive integer \(n\) is called \(r\)-free whenever it is not divisible by the \(r\)-th power of a prime. By convention, \(2\)-free and \(3\)-free integers are called square-free and cube-free, respectively. Let \(\alpha > 1\) be an irrational number and with bounded partial quotients, \(\beta \in [0; \alpha)\). The Beatty sequence of parameter \(\alpha\) and \(\beta\) is defined by \(\{\lfloor \alpha n + \beta\rfloor\}_{n\in \mathbb{N}}\). It is known that \[ \sum_{\substack{n \leq x \\ \lfloor\alpha n+\beta\rfloor \text { is \(r\)-free}}} 1=\frac{x}{\zeta(r)}+O\left(x^{1 / 2 r+1 / 2+\varepsilon}\right) \] where \(\alpha>1\) is irrational number and with bounded partial quotients, \(\beta \in[0 ; \alpha)\), as \(x \rightarrow \infty\). Moreover, if \(\alpha>1\) irrational number and with bounded partial quotients, \(\beta \in[0 ; \alpha)\) then \[ \sum_{\substack{n \leq x \\ \lfloor\alpha n+\beta\rfloor, \lfloor\alpha n+\beta\rfloor+1 \text { are square-free}}} 1=\prod_p\left(1-\frac{2}{p^2}\right) x+O\left( x^{\frac{3}{4}+\varepsilon} \right). \] The authors generalize these results to a larger class of integers. Let \(k\) and \(r\) be fixed positive integers with \(1<r<k\). A positive integer \(n\) is called a \((k, r)\)-integer if \(n\) is of the form \(n=a^k b\), where \(a, b \in \mathbb{N}\) and \(b\) is \(r\)-free. \textbf{Theorem 1.} Let \(\alpha>1\) be an irrational number and with bounded partial quotients, \(\beta \in[0 ; \alpha)\). As \(x \rightarrow \infty\), we have \[ Q_{k, r}(x ; \alpha, \beta)=x \frac{\zeta(k)}{\zeta(r)}+O\left(x^{1 / 2 r+1 / 2+\varepsilon}\right) \] where \(Q_{k, r}(x ; \alpha, \beta)\) is the number of \((k, r)\)-integers of Beatty sequence \(\lfloor\alpha n+\beta\rfloor\), \(1 \leq n \leq x\) Theorem 2 gives asymptotic formula for the number of positive integers \(n \leq x\) such that \(\lfloor\alpha n+\beta\rfloor\) and \(\lfloor\alpha n+\beta\rfloor+1\) are \((k, r)\)-integers.
    0 references
    Beatty sequence
    0 references
    generalized \(r\)-free integer
    0 references
    \((k, r)\)-integer
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references