@gkucmierz/utils 3.1.0 → 3.2.0

package/main.mjs

@@ -83,6 +83,9 @@ import {
 import {
   memoize
 } from './src/memoize.mjs'
+import {
+  mobius, mobiusBI
+} from './src/mobius.mjs'
 import {
   mod, modBI
 } from './src/mod.mjs'
@@ -154,6 +157,7 @@ export * from './src/math3d.mjs';
 export * from './src/matrix.mjs';
 export * from './src/measure-performance.mjs';
 export * from './src/memoize.mjs';
+export * from './src/mobius.mjs';
 export * from './src/mod.mjs';
 export * from './src/n-choose-k.mjs';
 export * from './src/natural-search.mjs';
@@ -170,5 +174,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, chunks, chunksAsyncIterator, chunksIterator, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, goldenRatio, goldenRatioBI, goldenRatioStr, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, createLangtonsAnt, createUnlimitedGrid, lcm, lcmBI, ListNode, lucasLehmerBI, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, measurePerformance, memoize, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, setSafeInterval, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
+  SetCnt, Trie, arrayHistogram, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, binarySearchArr, binarySearchGE, binarySearchLE, binarySearchRangeIncl, chunks, chunksAsyncIterator, chunksIterator, combinations, combinationsIterator, consumeIteratorNonBlocking, copyCase, egcd, factors, factorsBI, formatBigNumber, formatBigNumberBI, wrapFn, gcd, gcdBI, getType, goldenRatio, goldenRatioBI, goldenRatioStr, gpn, gpnBI, bin2gray, gray2bin, Heap, heronsFormula, heronsFormulaBI, createLangtonsAnt, createUnlimitedGrid, lcm, lcmBI, ListNode, lucasLehmerBI, axisAngleToMatrix4, crossProduct, dotProduct, getRotationMatrixFromVectors, multiplyMatrix4, normalize, projectToTrackball, matrixAsArray, measurePerformance, memoize, mobius, mobiusBI, mod, modBI, nChooseK, naturalSearch, nelderMead, particleSwarmOptimization, permutations, permutationsIterator, phi, phiBI, powMod, powModBI, randNormal, array2range, range2array, setSafeInterval, simulatedAnnealing, squareRoot, squareRootBI, tonelliShanksBI
 ];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "3.1.0",
+  "version": "3.2.0",
   "type": "module",
   "description": "Usefull functions for solving programming tasks",
   "keywords": [
@@ -52,7 +52,8 @@
     "simulated-annealing",
     "rand-normal",
     "format-big-number",
-    "natural-search"
+    "natural-search",
+    "mobius"
   ],
   "files": [
     "main.mjs",

package/src/mobius.mjs

@@ -0,0 +1,31 @@
+import { factors, factorsBI } from './factors.mjs';
+
+/**
+ * Calculates the Mobius function μ(n) of a number.
+ * @param {number} n - A positive integer.
+ * @returns {number} The Mobius function value (1, -1, or 0).
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4LFARiArgZwQXwQDMYowEAiAAQHMBrLAYzBAFMYAvAeizhABscFANzBgaTLlFA|▶ Try it live in Instacode}
+ */
+export const mobius = n => {
+  if (n < 1) return 0;
+  if (n === 1) return 1;
+  const f = factors(n);
+  const unique = new Set(f);
+  if (unique.size !== f.length) return 0;
+  return f.length % 2 === 0 ? 1 : -1;
+};
+
+/**
+ * Calculates the Mobius function μ(n) of a BigInt.
+ * @param {bigint} n - A positive BigInt.
+ * @returns {number} The Mobius function value (1, -1, or 0).
+ * @see {@link https://instacode.app/run/FASwtgDg9gTgLgAgN4LFARiArgZwEICSCAvggGYxRgIBEAAgOYDWWAxmCAKYwBeA9FjggANjhoBuYMDSZchSUA|▶ Try it live in Instacode}
+ */
+export const mobiusBI = n => {
+  if (n < 1n) return 0;
+  if (n === 1n) return 1;
+  const f = factorsBI(n);
+  const unique = new Set(f);
+  if (unique.size !== f.length) return 0;
+  return f.length % 2 === 0 ? 1 : -1;
+};