Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[pull] master from TheAlgorithms:master #23

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 2 commits into AlgorithmAndLeetCode:master from TheAlgorithms:master
Sep 15, 2022
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
algorithm: Liouville function (TheAlgorithms#1100)
  • Loading branch information
itsAkshayDubey authored Sep 15, 2022
commit d1152144aa5d777f22666c91b44c1588cc7a0d01
25 changes: 25 additions & 0 deletions Maths/LiouvilleFunction.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
/*
* Author: Akshay Dubey (https://github.com/itsAkshayDubey)
* Liouville Function: https://en.wikipedia.org/wiki/Liouville_function
* For any positive integer n, define λ(n) as the sum of the primitive nth roots of unity.
* It has values in {−1, 1} depending on the factorization of n into prime factors:
* λ(n) = +1 if n positive integer with an even number of prime factors.
* λ(n) = −1 if n positive integer with an odd number of prime factors.
*/

/**
* @function liouvilleFunction
* @description -> This method returns λ(n) of given number n
* returns 1 when number has even number of prime factors
* returns -1 when number has odd number of prime factors
* @param {Integer} number
* @returns {Integer} 1|-1
*/

import { PrimeFactors } from './PrimeFactors.js'
export const liouvilleFunction = (number) => {
if (number <= 0) {
throw new Error('Number must be greater than zero.')
}
return PrimeFactors(number).length % 2 === 0 ? 1 : -1
}
19 changes: 19 additions & 0 deletions Maths/test/LiouvilleFunction.test.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
import { liouvilleFunction } from '../LiouvilleFunction'

const expectedValuesArray = [1, -1, -1, 1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1, -1, 1, 1, 1, -1, -1, -1, -1, -1, 1, -1, -1, 1, -1, 1, -1, -1, 1, 1, 1, 1, 1, -1, 1, -1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, 1, 1, -1, 1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1]

describe('Testing liouville function', () => {
for (let i = 1; i <= 100; i++) {
it('Testing for number = ' + i + ', should return ' + expectedValuesArray[i], () => {
expect(liouvilleFunction(i)).toBe(expectedValuesArray[i - 1])
})
}

it('should throw error when supplied negative numbers', () => {
expect(() => { liouvilleFunction(-1) }).toThrow(Error)
})

it('should throw error when supplied zero', () => {
expect(() => { liouvilleFunction(0) }).toThrow(Error)
})
})

AltStyle によって変換されたページ (->オリジナル) /