Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
MathOverflow is a question and answer site for professional mathematicians. It only takes a minute to sign up.
Is it known whether computing $\mu(n)$ for a given integer $n$ is as hard as factorization?
Required, but never shown