sjkaliski/numbers.js — pull request #63 by milroc (2012-12-18 00:22:14+00:00)
Title: numbers.prime and numbers.basic updates

**Added:**
*basic:*
* isInt(n)
* divMod(a, b)
* powerMod(a, b, m) - http://reference.wolfram.com/mathematica/ref/PowerMod.html
* egcd(a, b) - Extended Euclidian Algorithm
* modInverse(a, m) - calculate the modular inverse of a number

*prime:*
* millerRabin(n)
* sieve(n)

Test cases for all have been updated, with a modification to testing the simple primality test.