algorithm: Square free integer #1104

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,28 @@
	/*
	* Author: Akshay Dubey (https://github.com/itsAkshayDubey)
	* Square free integer: https://en.wikipedia.org/wiki/Square-free_integer
	* function to check if an integer has repeated prime factors.
	* return false if the number as repeated prime factors.
	* else true
	*/

	/**
	* @function isSquareFree
	* @description -> Checking if number is square free using prime factorization
	* If list of prime factors of the number contains repeated prime factors, then the number is not square free
	* therefore, the function will return false
itsAkshayDubey marked this conversation as resolved. Outdated Show resolved Hide resolved
	*
	* If list of prime factors of the number contains unique prime factors, then the number is square free
	* therefore, the function will return true
	* @param {number} number
	* @returns {boolean}
	*/

	import { PrimeFactors } from './PrimeFactors.js'
	export const isSquareFree = (number) => {
	const primeFactorsArray = PrimeFactors(number)
	if (number <= 0) {
	throw new Error('Number must be greater than zero.')
	}
	return primeFactorsArray.length === new Set(primeFactorsArray).size
	}

20 changes: 20 additions & 0 deletions Maths/test/IsSquareFree.test.js

Show comments View file Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

Navigation Menu