[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="GaloisMSetPol"></a>
GaloisMSetPol
</h2>

Computing of a polynomial of degree {n choose k} which
roots are products of k distinct roots of f.

<p><p>

<h3>
Syntax:
</h3>
<pre>g:= GaloisMSetPol(f, k);</pre>

<p>

<table>
<tr>
<td>int</td>
<td><pre>  k  </pre></td>
<td>must be positive</td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  f, g  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#GaloisGlobals">GaloisGlobals</a>, <a href="kashref.html#GaloisGroupsPossible">GaloisGroupsPossible</a>, <a href="kashref.html#GaloisModulo">GaloisModulo</a>, <a href="kashref.html#GaloisTree">GaloisTree</a>, <a href="kashref.html#GaloisRoots">GaloisRoots</a>, <a href="kashref.html#GaloisNumberToName">GaloisNumberToName</a>

<p>

<h3>
Description:
</h3>
Let f be a monic polynomial of degree n in Q,\; Q(x) or a
simple
relative order.This function computes a primitive polynomial
of degree {n choose k}. The roots of <tt> GaloisMSetPol</tt> are the
products of k distinct roots of f.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

kash> Zxy := PolyAlg(Zx);;
kash> y := Poly(Zxy, [1,0]);;
kash> f := y^5-x*(5*y-4);
y^5 - 5*x*y + 4*x
kash> g := GaloisMSetPol(f,3);
> y^10 + 20*x^2*y^7 - 125*x^3*y^6 + 128*x^3*y^5 - 400*x^4*y^4 + 1280*x^5*y^2 + 4\
096*x^6

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]