GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaScript/Maths/IsSquareFree.js at master · TheAlgorithms/JavaScript

Expand file tree

/

IsSquareFree.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
23 lines (21 loc) · 792 Bytes
/

IsSquareFree.js

Copy path

File metadata and controls

23 lines (21 loc) · 792 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
/*
* 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
* @param {number} number
* @returns {boolean} true if the number has unique prime factors, otherwise false
*/
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
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.