Hugo van der Sanden
Hugo van der Sanden
roadmap
As discussed at LPW, it would be useful to include some sort of roadmap document showing what's still to do and roughly what order you plan to do it. Hugo
``` % $PERL -MMath::Prime::Util=sqrtmod -wle 'print sqrtmod(4, 8) // "undef"' undef % MPU_NO_XS=1 $PERL -MMath::Prime::Util=sqrtmod -wle 'print sqrtmod(4, 8) // "undef"' 2 % ``` Spotted "if 8|n 'a' must =...
I'm writing code to fork multiple processes, each of which will test one number - anything from a primality test to a full factorization. Other than loading MPU and MPUG,...
I'd really love to see a release with some of the bugfixes and new features. What can I do to help make that happen? I have a lot of experience...
Using perl-5.34.0 with MPU-0.73. ``` % perl -MMath::GMP -MMath::Prime::Util=trial_factor -wle ' $x = Math::GMP->new(3)**91; print for trial_factor($x) ' 1937805869 2724724103 % ``` In `factor.c` I note that trial_factor takes a...
[cpan-testers](http://matrix.cpantesters.org/?dist=Math-Prime-Util+0.73) is showing all fails for perl-5.35.8 and .9. I'm not sure, but "Wstat 24" may mean that it received: ``` #define SIGXCPU 24 /* CPU time limit exceeded. */...
A correspondent wanted to run some of my code on a Windows machine, and after running into problems with a first attempt based around WSL managed to get further (at...
Given eg x = 2y and x == 6 (mod 8), we do not know the value of y (mod 8), but we can say y == 3 (mod 4)....
Hi Dana, how's the release coming along? :) My code just hit this today under MPU-0.73: ``` % cat t use strict; use warnings; use Math::GMP; use Math::Prime::Util qw{ invmod...
I found a need for `allsqrtmod`, and wrote (perl code for) the functions documented below. Would you be interested in incorporating some or all of these in MPU? If you...