OnWorks favicon

n-chinese-remainders download for Linux

Free download n-chinese-remainders Linux app to run online in Ubuntu online, Fedora online or Debian online

This is the Linux app named n-chinese-remainders whose latest release can be downloaded as n-chinese-remainders.1.2.tar.gz. It can be run online in the free hosting provider OnWorks for workstations.

Download and run online this app named n-chinese-remainders with OnWorks for free.

Follow these instructions in order to run this app:

- 1. Downloaded this application in your PC.

- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 3. Upload this application in such filemanager.

- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.

- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 6. Download the application, install it and run it.





"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/)


  • 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)

Programming Language




This is an application that can also be fetched from https://sourceforge.net/projects/nchineseremainders/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.