mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
34 lines
1.2 KiB
JavaScript
34 lines
1.2 KiB
JavaScript
/*
|
||
* Author: Akshay Dubey (https://github.com/itsAkshayDubey)
|
||
* Mobius Function: https://en.wikipedia.org/wiki/M%C3%B6bius_function
|
||
* For any positive integer n, define μ(n) as the sum of the primitive nth roots of unity.
|
||
* It has values in {−1, 0, 1} depending on the factorization of n into prime factors:
|
||
* μ(n) = +1 if n is a square-free positive integer with an even number of prime factors.
|
||
* μ(n) = −1 if n is a square-free positive integer with an odd number of prime factors.
|
||
* μ(n) = 0 if n has a squared prime factor.
|
||
*/
|
||
|
||
/**
|
||
* @function mobiusFunction
|
||
* @description -> This method returns μ(n) of given number n
|
||
* returns 1 when number is less than or equals 1
|
||
* or number has even number of prime factors
|
||
* returns 0 when number has repeated prime factor
|
||
* returns -1 when number has odd number of prime factors
|
||
* @param {Integer} number
|
||
* @returns {Integer}
|
||
*/
|
||
|
||
import { PrimeFactors } from './PrimeFactors.js'
|
||
export const mobiusFunction = (number) => {
|
||
const primeFactorsArray = PrimeFactors(number)
|
||
if (number <= 0) {
|
||
throw new Error('Number must be greater than zero.')
|
||
}
|
||
return primeFactorsArray.length !== new Set(primeFactorsArray).size
|
||
? 0
|
||
: primeFactorsArray.length % 2 === 0
|
||
? 1
|
||
: -1
|
||
}
|