FactorInteger
 Usage
Notes
 Further Examples
The prime factorization of  is  .
In[1]:=
|
Out[1]=
|
The number  is not a prime for  .
In[2]:=
|
Out[2]=
|
A prime over the integers may factor over the Gaussian integers.
In[3]:=
|
Out[3]=
|
Here is a  digit integer.
In[4]:=
|
In[5]:=
|
Out[5]=
|
Here is the factorization of  .
In[6]:=
|
Out[6]=
|
This large integer is not prime.
In[7]:=
|
In[8]:=
|
Out[8]=
|
Even after a long time on a fast computer, FactorInteger does not return the factorization of  . Using the option FactorComplete  False gives some factors that are easy to find.
In[9]:=
|
Out[9]=
|
Although the first four factors found are prime, the last is not.
In[10]:=
|
Out[10]=
|
| 
