Search Results for "ez-mod"

...crtwo: solves Chinese Remainder a pair at a time, (uses gcd), yet is still fast. Which means crtwo, unlike text book soln, uses an algorithm to solve or fail one mod equation at a time. showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3 shows sawtooth CR waves and visible soln align1: solves i m2 == j m2 + b -> {i,j,dist} (like PowerMod->i but b is any and gcd(m1,m2) not req.) ...

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. ...

info thy + machine learning for organization, inference, and analysis of networks. contributed by the wiggins lab, currently @ columbia university, NYC. material supported by NSF #0332479. Any opinions, findings, and conclusions or recommendations expres