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

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

Computes all divisors of an ideal.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := IdealDivisors (A);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>ideal</td>
<td><pre>  A  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
The <tt> IdealDivisors</tt> function computes a list containing
all divisors of an integral ideal. The underlying order of
A must be known to be maximal.

<p><p>

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

<pre>

kash> o := OrderMaximal(Z,2,-5);
Generating polynomial: x^2 + 5
Discriminant: -20 

kash> A := 6*o;
<6>
kash> IdealDivisors(A);
> [ <1>, <2, [1, 1]>, <4, [0, 2]>, <3, [1, 1]>, <
    [6 1]
    [0 1]
    >
    , <6, [2, 2]>, <3, [2, 1]>, <
    [6 5]
    [0 1]
    >
    , <6, [4, 2]>, <3>, <
    [6 3]
    [0 3]
    >
    , <6> ]

</pre>

<p>


<hr>

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