On the quantity of numbers of special form depending on the parity of the number of their different prime divisors
Let \(M\) be the set of positive integers such that all prime divisors belong to an infinite set of prime numbers. Assume that \(E\) and \(O\) are two subsets of \(M\) consisting of numbers with an even and odd number of these prime divisors, respectively. The author then obtains an asymptotic formula for the difference of the counting functions of \(E\) and \(O\).
scientific article; zbMATH DE number 6494188