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

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

Compute the number of (n, m)-smooth divisors.


<p><p>

<h3>
Syntax:
</h3>
<pre>N := AlffDivisorsSmoothNum(n, m, P);</pre>

<p>

<table>
<tr>
<td>integer</td>
<td><pre>  N  </pre></td>
<td>number of (n, m)-smooth divisors</td>
</tr>
<tr>
<td>integers</td>
<td><pre>  n, m  </pre></td>
<td></td>
</tr>
<tr>
<td>list</td>
<td><pre>  P  </pre></td>
<td>of integers</td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#AlffInit">AlffInit</a>, <a href="kashref.html#AlffOrders">AlffOrders</a>, <a href="kashref.html#AlffPlacesNum">AlffPlacesNum</a>

<p>

<h3>
Description:
</h3>
Given two integers n, m  &gt;=  0 and a list P such that
P[i] is the number of places of degree 1  &lt;=  i  &lt;= 
\min{ n, m } of a given
global function field, return the number of divisors D which
are (n,m)-smooth, i.e. D  &gt;=  0 and the support of D
consists of places of degree  &lt;=  m. A recursion from He2
is used.

<p><p>

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

<pre>

</pre>

<p>


<hr>

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