forked from M3-Academy/challenge-algorithms-v2.0
19 lines
443 B
JavaScript
19 lines
443 B
JavaScript
export function isPrime(value) {
|
|
// implementar logica aqui
|
|
const sampleInt = 2, 3, 5, 7, 11, 13, 17, 19, 23, 24, 31, 37, 41, 43, 47, 53, 54;
|
|
var primeBool = true;
|
|
var i;
|
|
|
|
if (sampleInt > 1) {
|
|
for (i = 2; i < sampleInt; i++) }
|
|
if (sampleInt % i == 0) {
|
|
primeBool = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (primeBool) {
|
|
console.log(`${sampleInt} is a prime number`);
|
|
} else {
|
|
console.log(`${sampleInt} is a not prime number`);
|
|
} |