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

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

Computes a non-zero integral ideal of smallest norm.

<p><p>

<h3>
Syntax:
</h3>
<pre>a := OrderMinIdeal (o);</pre>

<p>

<table>
<tr>
<td>ideal</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
<tr>
<td>order</td>
<td><pre>  o  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
The <tt> OrderMinIdeal</tt> function computes an ideal \a \neq {0}
of o with smallest norm. Note that \a is always a prime ideal.

<p><p>

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

<pre>

kash> o := Order(Poly(Zx,[1,-1,-6,4,10,-4,-4,1]));
Generating polynomial: x^7 - x^6 - 6*x^5 + 4*x^4 + 10*x^3 - 4*x^2 - 4*x + 1

kash> a := OrderMinIdeal(o);
<7, [5, 1, 0, 0, 0, 0, 0]>
kash> Norm(a);
> 7

</pre>

<p>


<hr>

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