Feature request for function mpz_primorial_ui

Shane Neph sjneph at gmail.com
Fri Jan 18 18:03:29 UTC 2019

This is a useful function.  Thank you for providing it.  Since it goes
through the trouble of finding and multiplying out all prime numbers <= n,
it would be even better if it also returned an unsigned long int that gives
the number of primes found and used in the calculation.

More information about the gmp-discuss mailing list