1 ! Copyright (C) 2007 Samuel Tardieu.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: combinators kernel lists.lazy math math.functions math.miller-rabin
4 math.order math.primes.list math.ranges sequences sorting
10 : find-prime-miller-rabin ( n -- p )
11 dup miller-rabin [ 2 + find-prime-miller-rabin ] unless ; foldable
15 : next-prime ( n -- p )
17 primes-under-million [ natural-search drop 1+ ] keep nth
19 next-odd find-prime-miller-rabin
24 dup primes-under-million natural-search nip =
30 0 primes-under-million seq>list
31 1000003 [ 2 + find-prime-miller-rabin ] lfrom-by
34 : lprimes-from ( n -- list )
35 dup 3 < [ drop lprimes ] [ 1- next-prime [ next-prime ] lfrom-by ] if ;
37 : primes-upto ( n -- seq )
39 { [ dup 2 < ] [ drop { } ] }
41 [ primes-under-million [ natural-search drop 1+ 0 swap ] keep <slice> ] }
42 [ primes-under-million 1000003 lprimes-from
43 rot [ <= ] curry lwhile list>array append ]
46 : primes-between ( low high -- seq )
49 [ natural-search drop ] keep [ length ] keep <slice> ; foldable
51 : coprime? ( a b -- ? ) gcd nip 1 = ; foldable