fhinkel · December 3, 2017 19:49 · Dec 3, 2017 · Dec 2, 2017
diff --git a/prime.js b/prime.js
@@ -1,5 +1,6 @@
 function isPrime(p) {
-    for(let i = 2; i <= Math.sqrt(p); i++) {
+    const upper = Math.sqrt(p);
+    for(let i = 2; i <= upper; i++) {
         if (p % i === 0 ) {
             return false;
         }

diff --git a/prime.js b/prime.js
@@ -0,0 +1,28 @@
+function isPrime(p) {
+    for(let i = 2; i <= Math.sqrt(p); i++) {
+        if (p % i === 0 ) {
+            return false;
+        }
+    }
+    return true;
+}
+
+// Return n-th prime
+function prime(n) {
+    if (n < 1) {
+        throw Error("n too small: " + n);
+    }
+    let count = 0;
+    let result = 1;
+    while(count < n) {
+        result++;        
+        if (isPrime(result)) {
+            count++;
+        }
+    }
+    return result;
+}
+
+module.exports = {
+    prime 
+};
No results found