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

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

Returns the ray residue ring modulo a congruence module.

<p><p>

<h3>
Syntax:
</h3>
<pre>g := RayResidueRingToAbelianGroup(m0 [, minf]);</pre>

<p>

<table>
<tr>
<td>group</td>
<td><pre>  g  </pre></td>
<td></td>
</tr>
<tr>
<td>ideal</td>
<td><pre>  m0  </pre></td>
<td></td>
</tr>
<tr>
<td>list of integers</td>
<td><pre>  minf  </pre></td>
<td>infinite primes</td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Returns the multiplicative group g of the ray residue ring
modulo a congruence module.
For more information see \hyperlink{RayResidueRing}{<tt> RayResidueRing</tt>}.

<p><p>

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

<pre>

kash> o := OrderMaximal(Poly(Zx, [1,6,2]));
Generating polynomial: x^2 + 6*x + 2
Discriminant: 28 

kash> m0 := Ideal(Elt(o, [0,3]));
<[0, 3]>
kash> g := RayResidueRingToAbelianGroup(m0, [1,2]);
> Group with relations:
[2 0 0 0]
[0 2 0 0]
[0 0 2 0]
[0 0 0 2]

</pre>

<p>


<hr>

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