|
D.4.9.3 primeList
Procedure from library modstd.lib (see modstd_lib).
- Usage:
- primeList(n); (resp. primeList(n,L); )
- Return:
- the intvec of n greatest primes <= 2147483647 (resp. n greatest
primes < L[size(L)] union with L)
Example:
| LIB "modstd.lib";
intvec L=primeList(10);
size(L);
==> 10
L[size(L)];
==> 2147483477
L=primeList(5,L);
size(L);
==> 15
L[size(L)];
==> 2147483323
|
|