Skip to main content
Theoretical Computer Science

Return to Answer

corrected parentheses, and mu(n) = 0 iff n is not squarefree.
Source Link
edit approved Jan 3, 2017 at 11:09
Community Bot
edit approved Jan 3, 2017 at 11:09
Community Bot
  • 1

One non-answer to your question is that SQUARE-FREE (is a number square free) is itself not known to be in P, and computing the Möbius function would solve this problem (since a square free number has $\mu(n) = 0$$\mu(n) \neq 0$).

One non-answer to your question is that SQUARE-FREE (is a number square free) is itself not known to be in P, and computing the Möbius function would solve this problem (since a square free number has $\mu(n) = 0$.

One non-answer to your question is that SQUARE-FREE (is a number square free) is itself not known to be in P, and computing the Möbius function would solve this problem (since a square free number has $\mu(n) \neq 0$).

Source Link
Suresh Venkat
Suresh Venkat
  • 32.2k
  • 4
  • 97
  • 272

One non-answer to your question is that SQUARE-FREE (is a number square free) is itself not known to be in P, and computing the Möbius function would solve this problem (since a square free number has $\mu(n) = 0$.