project-euler.026: simplify, use coprime? from math.primes.

diff --git a/extra/project-euler/026/026.factor b/extra/project-euler/026/026.factor
index 4f4466c3952a73523430f43b12542f05898f5736..efec389e18602440acdfe30bc282fc6ffa4d8879 100644 (file)
--- a/extra/project-euler/026/026.factor
+++ b/extra/project-euler/026/026.factor
@@ -34,16 +34,13 @@ IN: project-euler.026
 <PRIVATE
 
 : source-026 ( -- seq )
-    1 1000 (a,b) [ prime? ] filter [ 1 swap / ] map ;
+    999 primes-upto [ recip ] map ;
 
 : (mult-order) ( n a m -- k )
     3dup ^ swap mod 1 = [ 2nip ] [ 1 + (mult-order) ] if ;
 
 PRIVATE>
 
-: coprime? ( m n -- ? )
-    gcd 1 = nip ;
-
 : recurring-period? ( a/b -- ? )
     denominator 10 coprime? ;