Distribution of \alpha n +\beta modulo 1 over integers free from large and small primes

DOI10.4064/AA180218-10-9zbMATH Open1436.11099arXiv1711.06422OpenAlexW2949373737MaRDI QIDQ5226442FDOQ5226442

Authors: Kam-hung Yau 

Publication date: 31 July 2019

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: For any $varepsilon>0$, we obtain an asymptotic formula for the number of solutions $nlex$ to ${\displaystyle }$ lVert alpha n + �eta Vert < x^{-frac{1}{4}+varepsilon} ${\displaystyle }$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In addition, we also establish an asymptotic formula with an additional square-free condition on $n$. Moreover, if $alpha$ is quadratic irrational then the asymptotic formulas holds for all sufficiently large $x$. Our ingredients come from the Harman sieve which we adapt suitably to sieve for $[y,z]$-smooth numbers. The arithmetic information comes from estimates for exponential sums.

Full work available at URL: https://arxiv.org/abs/1711.06422

Recommendations

• The distribution of \(\alpha p\) modulo one
• On the distribution of fractional parts of a sequence \(\{\alpha p^k\}\) with prime arguments in an arithmetic progression
• Shifted values of the largest prime factor function and its average value in short intervals
• Almost-all results on the \(p^\lambda\) problem
• scientific article; zbMATH DE number 4202379
• On the residue classes of \(\pi(n)\) modulo \(t\)
• The Difference Between Consecutive Primes
• On the Distribution of αp Modulo One II
• Fractional and integral parts of $p^{λ}$
• Differences Between Consecutive Primes

zbMATH Keywords

sieve methodsexponential sumsDiophantine approximation

Mathematics Subject Classification ID

Diophantine approximation in probabilistic number theory (11K60) Estimates on exponential sums (11L07) Applications of sieve methods (11N36)

Cites Work

• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Prime-detecting sieves
• On the distribution of αp modulo 1
• The distribution of αp modulo one
• On the distribution of \(\alpha p\) modulo one. II
• The distribution of \(\alpha p\) modulo one
• On the Distribution of αp; Modulo One
• On the Distribution of αp Modulo One II
• On the distribution of ap ^k modulo one
• On the distribution of αp^k modulo 1
• The Distribution of αp ² Modulo 1
• Diophantine approximation with square-free numbers
• Diophantine approximation with square-free integers
• Title not available (Why is that?)
• Integers Free From Large and Small Primes
• Entiers sans grand ni petit facteur premier III
• Entiers sans grand ni petit facteur premier I
• Entiers sans grand ni petit facteur premier II

Cited In (3)

• DISTRIBUTION OF INTEGERS WITH PRESCRIBED STRUCTURE AND APPLICATIONS
• Diophantine approximation with smooth numbers
• Equidistribution of rational functions of primes mod \(q\)

This page was built for publication: Distribution of $\alpha n +\beta $ modulo 1 over integers free from large and small primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226442)