This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

SquareFreeQ

SquareFreeQ[expr]
gives True if expr is a square-free polynomial or number, and False otherwise.
SquareFreeQ
gives True if expr is square free with respect to the variables vars.
  • For integers m and n, SquareFreeQ[m+I n] automatically works over the Gaussian integers.
  • The following options can be given:
GaussianIntegersAutomaticwhether to allow Gaussian integers
Modulus0modulus for polynomial coefficients
12 has a factor 4, which is a square:
In[1]:=
Click for copyable input
Out[1]=
12 has a factor 4, which is a square:
In[2]:=
Click for copyable input
Out[2]=
 
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Integers:
Gaussian integers:
Univariate polynomials:
Multivariate polynomials:
Polynomials in specific variables:
Polynomials over a finite field:
This is square free over the integers:
Square-free Gaussian integers:
Square-free polynomials over finite fields:
The central binomial coefficients Binomial are not square free for n>4:
Square factors can be found using FactorSquareFreeList:
The polynomial p[x]/PolynomialGCD[p[x], p'[x]] is always square free:
MoebiusMu is zero for non-square-free integers:
Square-free integers:
Square-free Gaussian integers:
New in 6