Abstract

Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any positive integer m and all j =0, 1, . . . , m−1, we have #{n ≤ x : Ω(n) ≡ j(modm)} = x/m + o(xα), with α = 1. Building on
... read more