Use isprime function from Primes

src/Julia/Problem007.jl

@@ -8,18 +8,7 @@ Solution for Problem 7 of Project Euler
 https://projecteuler.net/problem=7
 =#
 
-function is_prime(n)
-    if n % 2 == 0 && n > 2
-        return false
-    end
-    for i in 3:2:2:round(sqrt(n) + 1)
-        if n % i == 0
-            return false
-        end
-    end
-    return true
-end
-
+using Primes
 
 function Problem7()
     #=
@@ -30,15 +19,14 @@ function Problem7()
     =#
     number = 2
     primeList = []
-    while length(primeList) < 10001
-        if is_prime(number)
+    while length(primeList) < 10_001
+        if isprime(number)
             append!(primeList,number)
         end
         number += 1
     end
-    ans = primeList[length(primeList)-1]
 
-    return ans
+    return primeList[length(primeList)]
 end