maths.primes: finish renaming fast-gcd to simple-gcd.

diff --git a/basis/math/primes/primes.factor b/basis/math/primes/primes.factor
index 8ed1675ca7f3185649ced3abbc6a3619087039ab..543be5bbdb38ca703f5502f7a7964b7395345926 100644 (file)
--- a/basis/math/primes/primes.factor
+++ b/basis/math/primes/primes.factor
@@ -76,7 +76,7 @@ PRIVATE>
 : nprimes ( n -- seq )
     2 swap [ [ next-prime ] keep ] replicate nip ;
 
-: coprime? ( a b -- ? ) fast-gcd 1 = ; foldable
+: coprime? ( a b -- ? ) simple-gcd 1 = ; foldable
 
 : random-prime ( numbits -- p )
     [ ] [ 2^ ] [ random-bits* next-prime ] tri

diff --git a/extra/math/primes/solovay-strassen/solovay-strassen.factor b/extra/math/primes/solovay-strassen/solovay-strassen.factor
index 12a940f2f089ef6f577e96efcc58e2a891b7906f..3daad08e6f29b61a45803be6a65ff206be986c38 100644 (file)
--- a/extra/math/primes/solovay-strassen/solovay-strassen.factor
+++ b/extra/math/primes/solovay-strassen/solovay-strassen.factor
@@ -12,7 +12,7 @@ IN: math.primes.solovay-strassen
     numtrials iota [
         drop
         n 1 - [1,b) random :> a
-        a n fast-gcd 1 > [ t ] [
+        a n simple-gcd 1 > [ t ] [
             a n jacobi n mod'
             a n 1 - 2 /i n ^mod = not
         ] if