steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

link to prime tests from prime docs

db4
Doug Coleman 2009-05-10 14:01:21 -05:00
parent bfb3507456
commit e946777fbb
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
basis/math/primes/factors/factors.factor
View File

@ -1,6 +1,7 @@
! Copyright (C) 2007-2009 Samuel Tardieu.
! See http://factorcode.org/license.txt for BSD license.
USING: arrays combinators kernel make math math.functions math.primes sequences ;
USING: arrays combinators kernel make math math.functions
math.primes sequences ;
IN: math.primes.factors
<PRIVATE

3
basis/math/primes/primes-docs.factor
View File

@ -49,9 +49,8 @@ HELP: unique-primes
}
{ $description "Generates a sequence of " { $snippet "n" } " unique prime numbers with exactly " { $snippet "numbits" } " bits." } ;
ARTICLE: "math.primes" "Prime numbers"
"The " { $vocab-link "math.primes" } " vocabulary implements words related to prime numbers." $nl
"The " { $vocab-link "math.primes" } " vocabulary implements words related to prime numbers. Serveral useful vocabularies exist for testing primality. The Sieve of Eratosthenes in " { $vocab-link "math.primes.erato" } " is useful for testing primality below five million. For larger integers, " { $vocab-link "math.primes.miller-rabin" } " is a fast probabilstic primality test. The " { $vocab-link "math.primes.lucas-lehmer" } " vocabulary implements an algorithm for finding huge Mersenne prime numbers." $nl
"Testing if a number is prime:"
{ $subsection prime? }
"Generating prime numbers:"