Skip to main content
SpringerLink
Log in

The k-free Divisor Problem

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

Abstract.

 Let be the number of k-free divisions of n, and let be the counting function of . We improve on the known estimates for the error term in the asymptotic formula for under the assumption of the Riemann Hypothesis. We also obtain an unconditional asymptotic formula for , for small y.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of South Carolina, Columbia, SC, , , , , , US

    A. Kumchev

Authors
  1. A. Kumchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

(Received 15 March 1999; in revised form 17 September 1999)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kumchev, A. The k-free Divisor Problem. Mh Math 129, 321–327 (2000). https://doi.org/10.1007/s006050050078

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006050050078

Search

Navigation