0
I Use This!
Low Activity

Commits : Listings

Analyzed about 17 hours ago. based on code collected about 17 hours ago.
Oct 28, 2024 — Oct 28, 2025
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
We enforce -1,0,1 for cmpint and signint. More... 4 months ago
Return small negative results as IVs More... 4 months ago
test for cmpint and cmpabsint were assuming {-1,0,1} while we (and GMP) only guarantee {neg,zero,pos}. Change tests. Also document that signint (like mpz_sgn) does guarantee {-1,0,1}. More... 5 months ago
Fix unsigned/signed char in BLS n-1 proof More... 5 months ago
perfect powers change to include 0. Follow mpz_perfect_power_p(n). More... 5 months ago
Don't use large values in range More... 5 months ago
Update TODO More... 5 months ago
Remove tfall test code. factorialmod and lucas{u,v,uv}mod changed for mod 1, 0, -1, and -n. More... 5 months ago
internal: sieving for unsigned longs for easier use with GMP More... 5 months ago
Merge pull request #53 from timlegge/synopsis More... 5 months ago
Merge pull request #50 from trizen/patch-2 More... 5 months ago
Twin prime sieving would miss 3 if it was in range and hi < 9. Resolves #51. More... 7 months ago
Fix some UV / unsigned long mismatches More... 7 months ago
Change asm to __asm__. References Math-Prime-Util issue 79. More... 7 months ago
Use PERL_NO_GET_CONTEXT. Resolves #54. More... 8 months ago
Fix issue in README's SYNOPSIS More... 10 months ago
Add falling_factorial and rising_factorial More... over 1 year ago
Switch ramanujan_tau to new hclassno method rtau. More... over 1 year ago
Add rtau for better ramanujan_tau computation More... over 1 year ago
Add simple hclassno_ui for internal use More... over 1 year ago
Finish const in factor.c More... over 1 year ago
const in gmp_main. Non-trivial offset changes to all sieving functions, surround_primes, next_prime, prev_prime. More... over 1 year ago
Second round of const inputs. Still need sieving in gmp_main and things in factor. More... over 1 year ago
More testing with is_deeply More... over 1 year ago
Fix for binomial with large first argument More... over 1 year ago
Add a couple more znprimroot values with very large results More... over 1 year ago
is_primitive_root doesn't need to check phi/2 as kronecker already checks (p-1)/2 More... over 1 year ago
znprimroot doesn't need to check phi/2 as kronecker already checks (p-1)/2 More... over 1 year ago
Another revamp of znprimroot. Faster again. We never use p^k for finding the root, always just p, which can be *huge* factoring p-1 instead of (p^k)-1. More... over 1 year ago
Revamp is_primitive_root() for performance More... over 1 year ago