Skip to content

IsSquareFree

Tests whether n has no repeated prime factors.

IsSquareFree(n)tests whether has no repeated prime factor.

Domain: Number theory

Details
  • An integer is squarefree if it is divisible by no perfect square other than 1.
  • Every prime is squarefree; 1 is vacuously squarefree.
  • Equivalent to . See MoebiusMu.
  • Returns False unless is provably squarefree.

Examples

See also: MoebiusMu, FactorInteger