Download
"chinese remainder" solves a system of equations over modulus quickly. crtwo is an improvement to Mathematica's release.
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.)
other funs:
Euclidians, showFactors, changeBaseArr, caesar, rsa,
inverseMod, IntToModTups (large number math for PC's)
crfindnSolnAfterxInEqm (solve saw wave LL,RL,LR,... intersects)
congruence, plots, y-shifted triangular wave solve, testing
(for historic reasons files are also in https://sourceforge.net/projects/periodictablemm/)
Features
- n-chinese-remainders gives any n consecutive soln to cr, not just one
- n-cr solves a pair at a time, offering more freedom to cr solving (can step, analyse faile pt)
- n-cr also has: caesar, InverseMod, congruenceX, ModAdd, cr-chart
- n-cr also has: euclidian funs, rsa, changeofbase, primefactoring, more
- latest 1.2 is both Mathematica 11.0 and 4.0 compatible (Plot options, packaging)
Project Samples
![chart of cr[{2,5,6},{3,7,10}]](http://a.fsdn.com/con/app/proj/nchineseremainders/screenshots/x.gif/max/max/1)
