All Questions

We know that computing number of prime factors implies efficient factoring algorithm (How hard is it to compute the number of prime factors of a given integer?). Let $\omega(n)$ be number of distinct ...