Search Results for "win linux"

"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...

The econ theory is the value of buy and sell are usually equal, at whatever free market price at the time, so if we trade between 2 things, holding the total of those 2 equal eachother, then you can buy without anyone selling, or sell without anyone buying. Just change from one equal valued type to the other, and the total of all the A's and all the B's are scaled instantly to be the same amounts. Those who change to the majority side lose, and those who change to the minority side win,...

Calculates how much time and money you need to win in the lottery. It uses multiple gthreads and gtk2 to sort 1 to 50 numbers until the user wins. Asking for the cost and time beetwin games, it calculates if you or your grandchildren will be rich.

GiANT is a graphical interface for computer algebra systems (OS X/UNIX/Win). Currently GiANT lets the user work with number fields via KASH, but we aim to develop it into a GUI Library to run on top of any CAS and expose any of its functions.

This is a conversion-to-binary training game prototype. Random bits appear, and you must shoot them where they fit onto various bytes (given in octal, hex or even bit ops, decimal or Ascii). Shoot wrongly and you lose that byte, or get it right and win.