Independence measures of arithmetic functions II
Let and . Denote by the set of all integers whose canonical prime representation has all exponents being a multiple of or belonging to the arithmetic progression , . All integers in are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given.
Page 1