An integer $n \neq 0$ is square-free if $n$ is divisible by no prime square. Can you figure out any notation for simplifying this long description?
It may be guessed that $p^{2} \nmid n$ for any prime $p$ is okay, but this is still a bit long.
An integer $n \neq 0$ is square-free if $n$ is divisible by no prime square. Can you figure out any notation for simplifying this long description?
It may be guessed that $p^{2} \nmid n$ for any prime $p$ is okay, but this is still a bit long.
Well, we could use $\mu(n)\ne 0$. Here $\mu$ is the Möbius function. I prefer (by a lot) to say square-free.