smath 2.0.0 → 2.1.0

package/dist/bin.js

@@ -24,6 +24,7 @@ if (func.includes('help')) {
     console.log('  logspace <min> <max> <n> : Generate `n` logarithmically spaced numbers between `min` and `max`');
     console.log('  factorial <n>            : Compute `n!` (factorial)');
     console.log('  factors <n>              : List the prime factors of `n`');
+    console.log('  isPrime <n>              : Determine if `n` is prime');
     console.log('  round2 <n> <base>        : Round `n` to a multiple of any `base`');
     console.log('  error <exp> <act>        : Calculate the normaized percent error between `exp` and `act`');
     console.log('  sum <c0> [c1] ... [cn]   : Compute a total of `n` numbers');
@@ -85,6 +86,10 @@ switch (func) {
         console.log(SMath.factors(nums[0]));
         break;
     }
+    case ('isPrime'): {
+        console.log(SMath.isPrime(nums[0]));
+        break;
+    }
     case ('round2'): {
         console.log(SMath.round2(nums[0], nums[1]));
         break;

package/dist/smath.js

@@ -150,6 +150,29 @@ export function factors(n) {
     }
     return f;
 }
+/**
+ * An optimized algorithm to determine if any number is prime.
+ * @param n Any positive integer
+ * @returns `true` if `n` is prime
+ */
+export function isPrime(n) {
+    if (n <= 1 || (n | 0) !== n) {
+        return false;
+    }
+    if (n <= 3) {
+        return true;
+    }
+    if (n % 2 === 0 || n % 3 === 0) {
+        return false;
+    }
+    // Check 6x-1 and 6x+1 (all prime forms)
+    for (let i = 5; i * i <= n; i += 6) {
+        if (n % i === 0 || n % (i + 2) === 0) {
+            return false;
+        }
+    }
+    return true;
+}
 /**
  * Round a number to the nearest multiple of an arbitrary
  * base. Does not round when the base is set to zero.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "smath",
-  "version": "2.0.0",
+  "version": "2.1.0",
   "description": "Small math function library",
   "homepage": "https://npm.nicfv.com/",
   "type": "module",

package/types/smath.d.ts

@@ -91,6 +91,12 @@ export declare function factorial(n: number): number;
  * const y = SMath.factors(12); // [ 2, 2, 3 ]
  */
 export declare function factors(n: number): number[];
+/**
+ * An optimized algorithm to determine if any number is prime.
+ * @param n Any positive integer
+ * @returns `true` if `n` is prime
+ */
+export declare function isPrime(n: number): boolean;
 /**
  * Round a number to the nearest multiple of an arbitrary
  * base. Does not round when the base is set to zero.