The distribution of r-free numbers in arithmetic progressions

Abstract

A positive integer n is called r-free if n is not divisible by the r-th power of a prime. Generalizing earlier work of Orr, we provide an upper bound of Bombieri-Vinogradov type for the r-free numbers in arithmetic progressions.

5 pages

Cited by in corpus (1)

• Numerical calculation of the Riemann zeta function at odd integer arguments: A direct formula method