GCD
 Usage
Notes
 Further Examples
Here are some examples.
In[1]:=
|
Out[1]=
|
In[2]:=
|
Out[2]=
|
In[3]:=
|
Out[3]=
|
In[4]:=
|
Out[4]=
|
Here is an equality satisfied by GCD.
In[5]:=
|
Out[5]=
|
The Fermat Numbers FermatNumber[n] are relatively prime. This in particular implies that there are infinitely many prime numbers.
In[6]:=
|
In[7]:=
|
Out[7]=
|
| 
