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

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

Lifts an integer modulo m to a rational.

<p><p>

<h3>
Syntax:
</h3>
<pre>q := RationalReconstruct (u,m);</pre>

<p>

<table>
<tr>
<td>rational</td>
<td><pre>  q  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  u  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  m  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Given positive integers u,m, the function <tt> RationalReconstruct</tt>
computes a rational number q = frac{a}{b} such that a \equiv bu
\bmod m and 0 \le |a|,b < \sqrt{frac{m}{2}},b \neq 0, if such a
pair exists.
Otherwise the <tt> 0</tt> is returned.

<p><p>

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

<pre>

kash> RationalReconstruct(17,49);
> 2/3

</pre>

<p>


<hr>

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