@gkucmierz/utils 2.0.6 → 2.0.7

package/README.md

@@ -41,6 +41,7 @@ This library provides a wide range of mathematical functions and data structures
   - `mod`, `powMod`: Modular arithmetic with Python-like behavior for negative numbers.
   - `egcd`: Extended Euclidean Algorithm.
   - `tonelliShanksBI`: Modular square root algorithm.
+  - `lucasLehmerBI`: Lucas-Lehmer primality test for Mersenne primes.
 
 - **Sequences & Formulas**:
   - `gpn`: Generalized Pentagonal Numbers.

package/main.mjs

@@ -59,6 +59,9 @@ import {
 import {
   ListNode
 } from './src/list-node.mjs'
+import {
+  lucasLehmerBI
+} from './src/lucas-lehmer.mjs'
 import {
   axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball
 } from './src/math3d.mjs'
@@ -128,6 +131,7 @@ export * from './src/heap.mjs';
 export * from './src/herons-formula.mjs';
 export * from './src/lcm.mjs';
 export * from './src/list-node.mjs';
+export * from './src/lucas-lehmer.mjs';
 export * from './src/math3d.mjs';
 export * from './src/matrix.mjs';
 export * from './src/memoize.mjs';
@@ -146,5 +150,5 @@ export * from './src/square-root.mjs';
 export * from './src/tonelli-shanks.mjs';
 
 export default [
-  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, memoize, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
+  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, lucasLehmerBI, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, memoize, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "2.0.6",
+  "version": "2.0.7",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
@@ -19,8 +19,10 @@
     "iterator",
     "javascript",
     "lcm",
+    "lucas-lehmer",
     "math",
     "memoize",
+    "mersenne",
     "mod",
     "n-choose-k",
     "node",
@@ -29,6 +31,8 @@
     "permutations",
     "phi",
     "pow-mod",
+    "primality-test",
+    "prime",
     "range-array",
     "square-root",
     "tonelli-shanks",

package/src/lucas-lehmer.mjs

@@ -0,0 +1,18 @@
+/**
+ * Calculates whether a given Mersenne number (2^p - 1) is prime using the Lucas-Lehmer primality test.
+ * 
+ * @param {number|bigint} exp - The exponent p of the Mersenne number M_p.
+ * @param {boolean} [verbose=false] - If true, logs the calculation progress.
+ * @returns {boolean} True if the Mersenne number is prime, false otherwise.
+ */
+export const lucasLehmerBI = (exp, verbose = false) => {
+  const steps = exp - 2;
+  const prime = 2n ** BigInt(exp) - 1n;
+  verbose && console.log('prime: ', prime);
+  let s = 4n;
+  for (let i = 0; i < steps; ++i) {
+    s = (s ** 2n - 2n) % prime;
+    verbose && console.log(i, s);
+  }
+  return s === 0n;
+};