PolynomialGCD
 Usage
• PolynomialGCD[ ,  , ... ] 给出多项式  的最大公约数。 • PolynomialGCD[ ,  , ... , Modulus->p] 计算模 p的最大公约数。
Notes
• 例如： PolynomialGCD[1 + x y, x + x^2 y]  . • 在 PolynomialGCD[ ,  , ... ], 所有的符号参数处理为变量。 • PolynomialGCD[ ,  , ... ] 缺省处理在  中作为独立变量出现的代数数。 • PolynomialGCD[ ,  , ... , Extension->Automatic] 扩展系数域来包含出现在  中的代数数。 • 参见 Mathematica 全书 : 节 3.3.4.
 Further Examples
This gives the greatest common divisor of a pair of polynomials.
In[1]:=
|
Out[1]=
|
Here is the greatest common divisor of another pair.
In[2]:=
|
In[3]:=
|
Out[3]=
|
In[4]:=
|
We can take the gcd of polynomials involving Gaussian rationals, and this can even be done modulo a real Gaussian prime.
In[5]:=
|
In[6]:=
|
In[7]:=
|
Out[7]=
|
In[8]:=
|
Out[8]=
|
In[9]:=
|
This pair of polynomials are taken to be over an extension of the rational numbers. PolynomialGCD cannot find a nontrivial gcd with the default setting of None for the option Extension.
In[10]:=
|
Out[10]=
|
PolynomialGCD finds a nontrivial gcd when the option Extension is set to Automatic.
In[11]:=
|
Out[11]=
|
In[12]:=
|
Out[12]=
|
|
