M

Math-Prime-Util

Settings | Report Duplicate

0

I Use This!

Activity Not Available

Commits : Listings

Analyzed 12 months ago. based on code collected 12 months ago.

Commit Message	Contributor	Files Modified	Lines Added	Lines Removed	Code Location	Date
Jan 16, 2023 — Jan 16, 2024 Showing page 1 of 81 Search / Filter on:
Changes to is_pseudoprime and is_euler_pseudoprime with n=3. is_strong_pseudoprime for 3 as well as for bases a multiple of n.	Dana Jacobsen	More...				over 1 year ago
ntheory function list document had Jordan totient arguments reversed	Dana Jacobsen	More...				over 1 year ago
Add XS recursive omega prime generator. Github issue #67.	Dana Jacobsen	More...				over 1 year ago
Add muladdmod and mulsubmod to spelling for extended tests	Dana Jacobsen	More...				over 1 year ago
nth_almost_prime uses new interpolation routine's hi generator	Dana Jacobsen	More...				over 1 year ago
New XS inverse interpolation using Ridder's method.	Dana Jacobsen	More...				over 1 year ago
Add inverse interpolate routine to PP. Uses Ridder's method.	Dana Jacobsen	More...				over 1 year ago
nth_semiprime_approx lower limit was too high	Dana Jacobsen	More...				over 1 year ago
Make twin primes approx monotonic, at the expense of slightly worse approximation	Dana Jacobsen	More...				over 1 year ago
Add 64-bit max for 5-almost-prime, so all max values now known.	Dana Jacobsen	More...				over 1 year ago
Interpolation lower value wasn't correct in nth_ramanujan_prime_approx	Dana Jacobsen	More...				over 1 year ago
Add is_divisible and is_congruent	Dana Jacobsen	More...				over 1 year ago
Better estimates for nth_almost_prime. See Github issue #71.	Dana Jacobsen	More...				over 1 year ago
PP addmod, submod, mulmod were using >0 and <INTMAX for native comparisons	Dana Jacobsen	More...				over 1 year ago
Use muladdmod and mulsubmod in PP	Dana Jacobsen	More...				over 1 year ago
Add muladdmod and mulsubmod functions. These are used a lot, having these functions is cleaner and more efficient (not in GMP or C, but it is for the Perl calls)	Dana Jacobsen	More...				over 1 year ago
Move all PP lucas_sequence calls to lucasuvmod. Native inputs are much faster, but bigints are slower.	Dana Jacobsen	More...				over 1 year ago
Add generic case for PP lucasuvmod	Dana Jacobsen	More...				over 1 year ago
is_odd,is_even PP fixes. Speedups for PP lucasuvmod.	Dana Jacobsen	More...				over 1 year ago
Add is_odd and is_even	Dana Jacobsen	More...				over 1 year ago
Updates to lucasuvmod	Dana Jacobsen	More...				over 1 year ago
Move Lucas sequences to separate file. lucas* calls in XS handle non-IV P/Q arguments. lucasuvmod doesn't return Q^k.	Dana Jacobsen	More...				over 1 year ago
PP use GMP for lucasu/lucasv/lucasumod/lucasvmod. Fast Q=1 lucasvmod.	Dana Jacobsen	More...				over 1 year ago
Move PP foralmostprimes to PP.pm, have it use generator in segments.	Dana Jacobsen	More...				over 1 year ago
64-bit count for 4-almost-primes, tune upper bound.	Dana Jacobsen	More...				over 1 year ago
Big speedups for C almost_primes with large start	Dana Jacobsen	More...				over 1 year ago
cheb_factor in PP	Dana Jacobsen	More...				over 1 year ago
Small fixes for release tests	Dana Jacobsen	More...				over 1 year ago
Add some simple tests for cdivint	Dana Jacobsen	More...				over 1 year ago
divceilint => cdivint	Dana Jacobsen	More...				over 1 year ago

←
1
2
3
4
5
6
7
8
9
…
80
81
→