|
|
|
|
|
|
 |
 |
|
n-chinese-remainders
|
|
|
|
|
|
|
|
|
|
|
|
2013-10-27
|
|
|
|
|
|
crtwo: solves Chinese Remainder a pair at a time (employs gcd use, offers new freedoms in cr solving) crAll2@crtwo provides n soln near x for CR using width 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, gcd(m1,m2) is not req.
other funs (mod related topics): Euclidians, showFactors, changeBaseArr, caesar, rsa, inverseMod, IntToModTups (large number math for PC's) congruence, crfindnSolnAfterxInEqm (sawtooth wave LL,RL,LR,...intersects) plots, y-shifted triangular wave, tests for
|
|
|
|
|
|
|
|
|
|
|
|
number theory, Chinese Remainder Theorem, Mod, sawtooth wave, triangular wave, euclalg, euclalglist, euclbacksolve, euclextgcd, inverseMod, testgen, showFactors, changeBaseAArr, caesar, crtwo, cralign1, align1, crchart3, creqs, crfindnSolnAfterxInEqm, crAll, crAll2, IntToModTups, congQ, congX, crbruteforce, crtestnotcong, crtestcong
|
|
|
|
|
|
http://sourceforge.net/p/nchineseremainders/
|
|
|
|
|
|
| n-chinese-remainders.1.1.tar.gz (263.2 KB) - GZIP archive |
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
