Pairs of k-free Numbers, consecutive square-full Numbers
Abstract
We consider the error term of the asymptotic formula for the number of pairs of -free integers up to . Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to -tuples of -free numbers and improve previous results by Tsang. Furthermore, we establish an error term for consecutive square-full integers. Finally, we will show that for all and for almost all , the fundamental solution associated to the Pell equation satisfies . This improves/recovers previous results by Fouvry and Jouve. The main tool of our work is the approximate determinant method.
Keywords
Cite
@article{arxiv.1212.3150,
title = {Pairs of k-free Numbers, consecutive square-full Numbers},
author = {T. Reuss},
journal= {arXiv preprint arXiv:1212.3150},
year = {2014}
}
Comments
28 pages. The proof of the theorem about consecutive k-free numbers has been reworked and errors and typos have been corrected. The error exponent is now much stronger for k>3. A further application of the method about the size of the fundamental solution of a Pell equation has been added. References to work of Dietmann/Marmon and Fouvry/Jouve have been added. The paper has been restructured