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 k-free integers up to x. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to r-tuples of k-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 and for almost all D, the fundamental solution εD associated to the Pell equation x2-Dy2=1 satisfies εD> Dθ. This improves/recovers previous results by Fouvry and Jouve. The main tool of our work is the approximate determinant method.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.