fixup

Author: oscardssmith

src/Primes.jl

@@ -387,15 +387,15 @@ function iterate(f::FactorIterator{T}, state=(f.n, T(3))) where T
         return (n, 1), (T(1), n)
     end
     # check for n=root^r
-    r = cld(ndigits(n, base=2), ndigits(Primes.PRIMES[end], base=2))
-    root = inthroot(n, r)
+    r = cld(ndigits(n, base=2), ndigits(N_SMALL_FACTORS, base=2))
+    root = iroot(n, r)
     while r >= 2
         if root^r == n
             isprime(root) && return (root, r), (n, root+2)
 
         end
         r -= 1
-        root = inthroot(n, r)
+        root = iroot(n, r)
     end
 
     should_widen = T <: BigInt || widemul(n - 1, n - 1) ≤ typemax(n)