English

Pairs of k-free Numbers, consecutive square-full Numbers

Number Theory 2014-03-20 v2

Abstract

We consider the error term of the asymptotic formula for the number of pairs of kk-free integers up to xx. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to rr-tuples of kk-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 θ<3\theta<3 and for almost all DD, the fundamental solution ϵD\epsilon_D associated to the Pell equation x2Dy2=1x^2-Dy^2=1 satisfies ϵD>Dθ\epsilon_D> D^\theta. 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