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

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

Computing of a polynomial of degree ncdot(n-1) which
roots are products of two distinct roots of f.

<p><p>

<h3>
Syntax:
</h3>
<pre>g:= GaloisTwoSequencePol(f);</pre>

<p>

<table>
<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>, <a href="kashref.html#GaloisBlocks">GaloisBlocks</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 \* (n-1). The roots of
<tt> Galois\-TwoSequencePol</tt> are the products of
the form x|i+2x|j, where x|i and x|j are
distinct roots of f.

<p><p>

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

<pre>

kash> f := x^6-3*x^5+6*x^4-7*x^3+2*x^2+x-4;
x^6 - 3*x^5 + 6*x^4 - 7*x^3 + 2*x^2 + x - 4
kash> g := GaloisTwoSequencePol(f);
> x^30 - 45*x^29 + 1026*x^28 - 15687*x^27 + 179817*x^26 - 1639404*x^25 + 1232376\
0*x^24 - 78227505*x^23 + 426372238*x^22 - 2019887529*x^21 + 8394234972*x^20 - \
30824981910*x^19 + 100623894335*x^18 - 293550986223*x^17 + 769208456704*x^16 -\
 1819602767877*x^15 + 3905435727190*x^14 - 7640849227485*x^13 + 13675751675898\
*x^12 - 22435288075854*x^11 + 33744397630017*x^10 - 46517472600975*x^9 + 58815\
885814020*x^8 - 68378015808513*x^7 + 73157522800460*x^6 - 71284825965465*x^5 +\
 61112931042866*x^4 - 43100727314520*x^3 + 22477430709080*x^2 - 7271427323616*\
x + 984235529312

</pre>

<p>


<hr>

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