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

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

db4
John Benediktsson 2015-05-13 14:46:59 -07:00
parent 4af2c7ea1f
commit ba3c232c65
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
extra/project-euler/026/026.factor
View File

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