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

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

Computes the prime ideal factorization of an algebraic integer.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := EltFactor(a);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>algebraic element</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#Factor">Factor</a>

<p>

<h3>
Description:
</h3>
The <tt> EltFactor</tt> function returns the prime ideal
decomposition of the principal ideal generated by the
algebraic element a. The element must be defined over a
maximal order or its norm must be coprime to the
discriminant of the equation order.

<p><p>

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

<pre>

kash> o := Order(Z,2,-110);
Generating polynomial: x^2 + 110

kash> O := OrderMaximal(o);
Generating polynomial: x^2 + 110
Discriminant: -440 

kash> alpha := Elt(O, [0,1]);
[0, 1]
kash> EltFactor(alpha);
[ [ <11, [0, 1]>, 1 ], [ <5, [0, 1]>, 1 ], [ <2, [0, 1]>, 1 ] ]
kash> IdealFactor(alpha*O);
> [ [ <2, [0, 1]>, 1 ], [ <5, [0, 1]>, 1 ], [ <11, [0, 1]>, 1 ] ]

</pre>

<p>


<hr>

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