Skip to content

Update checkPrime.js #69

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.

Sign up for GitHub

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

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

Update checkPrime.js #69

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
cbdb958
Update checkPrime.js
Rudxain Oct 5, 2022
d45ff36
Enable strict mode
Rudxain Oct 5, 2022
4fda49b
Update checkPrime.js
Rudxain Oct 5, 2022
aaca0c7
Update checkPrime.js
Rudxain Oct 5, 2022
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
45 changes: 25 additions & 20 deletions algorithms/math/checkPrime.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,25 +1,30 @@
// JavaScript implementation of prime number checking
//
// Author: Nikolas Huebecker

function isPrime(n){
var divisor = 2;

while (n > divisor){
if(n % divisor == 0){
return false;
}else {
divisor++;
}
}
"use strict";

/**
* JS implementation of primality testing
* @param {number} n
* @author Nikolas Huebecker
* @author Ricardo Fernández Serrata
*/
const isPrime = n => {
if (!Number.isInteger(n))
return false;

n = Math.abs(n);

if (n % 2 === 0)
return n === 2;

const rt = Math.sqrt(n);

for (let d = 3; d <= rt; d += 2)
if (n % d === 0)
return false;

return true;
}

// Test

console.log("The number 137 is prime:"
console.log(isPrime(137))


console.log("The number 16 is prime:"
console.log(isPrime(16))
for (const n of [137, 16, 24, 127, 11])
console.log(`The number ${n} is prime: ${isPrime(n)}`)