FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScript/Maths/IsSquareFree.js at master · TheAlgorithms/JavaScript · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
TheAlgorithms
/
JavaScript
Public
Uh oh!
There was an error while loading.
Please reload this page
.
Notifications
You must be signed in to change notification settings
Fork
5.8k
Star
34.2k
Code
Issues
21
Pull requests
192
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScript
/
Maths
/
IsSquareFree.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
23 lines (21 loc) · 792 Bytes
Breadcrumbs
JavaScript
/
Maths
/
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
}
Back
|
FazBrowse Home
|
New Git URL