Pairs of k-free Numbers, consecutive square-full Numbers
arXiv:1212.3150
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.
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
References in corpus (2)
Cited by in corpus (12)
- Squarefree polynomials and Mobius values in short intervals and arithmetic progressions
- The density of twins of -free numbers
- Height of rational points on quadratic twists of a given elliptic curve
- On the number of pairs of positive integers such that , are square-free
- Consecutive square-free values of the form
- Consecutive square-free numbers of a special form
- Moments of the distribution of -free numbers in short intervals and arithmetic progressions
- Distance between natural numbers based on their prime signature
- Configurations Of Consecutive Primitive Roots
- Square-full values of quadratic polynomials
- On the -free values of the polynomial
- Pairs of square-free values of the type ,