UNPKG

algebrite/sources/mprime.coffee

Version:

246 Btext/coffeescriptView Raw

1# Bignum prime test (returns 1 if prime, 0 if not)
2
3# Uses Algorithm P (probabilistic primality test) from p. 395 of
4# "The Art of Computer Programming, Volume 2" by Donald E. Knuth.
5
6
7
8
9mprime = (n) ->
10	return n.isProbablePrime()
11
12#if SELFTEST
13

1	`# Bignum prime test (returns 1 if prime, 0 if not)`
2
3	`# Uses Algorithm P (probabilistic primality test) from p. 395 of`
4	`# "The Art of Computer Programming, Volume 2" by Donald E. Knuth.`
5
6
7
8
9	`mprime = (n) ->`
10	`return n.isProbablePrime()`
11
12	`#if SELFTEST`
13