danaj / Math-Prime-Util

Perl (XS) module implementing prime number utilities, including sieves

danaj/Math-Prime-Util Issues

`prime_count(a,b)` is slow for large `a` and `b`, with `|a-b|` small.
Updated a month ago
Generation of k-almost primes in a given range is slow
Closed 3 months ago5
the principle of the algorithm 'lucas sequence'
Updated 9 months ago
pseudoprime, euler_pseudoprime, strong_pseudoprime not consistent
Closed a year ago2
"Out of memory!" for `omega_primes(12, 1e13)`
Closed a year ago3
[github version] `nth_almost_prime(k, n)` sometimes returns 0
Closed a year ago3
sqrtmod(4, 8) fails
Updated a year ago8
Solving (generalised) pell equation
Closed 4 years ago2
Segmentation fault inside `forprimes { }`
Closed a year ago1
How to prepare for forking?
Updated a year ago2
PP allrootmod() failure
Closed a year ago2
[github version] C implementation of `omega_prime_count(k,n)` is slower than the PP version
Closed a year ago2
PP validation failure
Closed a year ago
`lcm()` of an empty list should be 1
Closed a year ago
logint(a,b) incorrect for large b with b > a
Closed a year ago
What can I do to help get a release out?
Updated 2 years ago4
trial_factor errors (truncation?)
Updated 2 years ago
test failures with latest bleadperl
Updated 2 years ago22
[github version] Some test failures on Android (32-bit)
Updated 2 years ago2
MPU and Strawberry perl on Windows
Updated 2 years ago
2-value divmod
Updated 2 years ago2
invmod(p, q) can wrongly fail
Updated 2 years ago1
Test `t/70-rt-bignum.t` seems to hang with bignum >= 0.6x
Closed 3 years ago3
[proposal] functions for k-powerfree numbers
Closed 3 years ago3
feature: allsqrtmod(a, n)
Updated 3 years ago4
Bad prototype for is_pseudoprime()?
Closed 3 years ago5
Possibly misleading error message
Updated 3 years ago1
PP sqrtmod(-a, n) fails
Updated 3 years ago1
Reduce branch mispredictions in prime counting sieve
Closed 3 years ago1
More efficient phi(x, a) caching
Updated 3 years ago11
Minor inconsistency: is_extra_strong_lucas_pseudoprime(5) returns 0
Closed 3 years ago6
[proposal] Faster algorithm for computing the Mertens function
Closed 4 years ago5
[feature request] Image of sigma() function
Updated 4 years ago3
Memory leak in inverse_totient()
Closed 4 years ago2
Minor issue in mulmod, addmod and divmod with a non-native negative integer
Closed 4 years ago2
[suggestion] Subquadratic algorithm for fromdigits([...], b)
Closed 4 years ago3
MPU 0.62 tests hang on macOS
Closed 4 years ago14
[suggestion] Counting of prime powers and perfect powers
Closed 4 years ago1
[suggestion] New functions for powerful numbers.
Closed 4 years ago3
[suggestion] Algorithm for counting k-smooth numbers <= n.
Closed 4 years ago4
[suggestion] Algorithm for counting k-almost primes <= n.
Closed 4 years ago3
[suggestion] Algorithm for checking if n is k-smooth.
Closed 4 years ago3
todigitstring("n",b) with very large n, returns NaN
Closed 4 years ago2
Memory leak in forsquarefree
Closed 4 years ago2
is_totient fails
Closed 4 years ago
prime sieve benchmark
Updated 4 years ago
[PRC] How may I be of help?
Updated 6 years ago4
t/26-pillai too slow
Updated 6 years ago1
Incorrect values from prime_count(n, m) with 3 <= n <= 7
Closed 7 years ago4
`urandomm(n)` returns two values for certain numerical objects
Closed 7 years ago3