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

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

missing shortdoc

<p><p>

<h3>
Syntax:
</h3>
<pre>c := IdealMakeCoprime(A,B));</pre>

<p>

<table>
<tr>
<td>ideal </td>
<td><pre>  A,B  </pre></td>
<td></td>
</tr>
<tr>
<td>algebraic number </td>
<td><pre>  c  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#IdealMakeInvCoprime">IdealMakeInvCoprime</a>, <a href="kashref.html#IdealClassRep">IdealClassRep</a>, <a href="kashref.html#OrderClassGroup">OrderClassGroup</a>

<p>

<h3>
Description:
</h3>
Let \a and \b integral ideals. The procedure finds c so
that c\a
is an integral ideal coprime to \b.
This algorithm is due to a paper by H. Cohen CoDe.

<p><p>

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

<pre>

kash> O := OrderMaximal(x^2-10);
Generating polynomial: x^2 - 10
Discriminant: 40 

kash> OrderClassGroup(O,500,"euler","fast");
[ 2, [ 2 ] ]
kash> A := OrderClassGroupCyclicFactors(O)[1][1];
<2, [0, 1]>
kash> B := 2*O;
<2>
kash> c := IdealMakeCoprime(A,B);
[0, 1] / 2
kash> D := c*A;
<5, [0, 1]>
kash> IdealClassRep(D);
> [ [ <2, [0, 1]>, 1 ] ]

</pre>

<p>


<hr>

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