forked from M3-Academy/challenge-algorithms-v2.0
14 lines
272 B
JavaScript
14 lines
272 B
JavaScript
export function isPrime(value) {
|
|
// implementar logica aqui
|
|
let divisores = 0;
|
|
|
|
for (let i = 1; i <= value; i++) {
|
|
if (value % i == 0) {
|
|
divisores++;
|
|
}
|
|
}
|
|
|
|
let isPrimoNotPrimo = (divisores == 2) ? true : false;
|
|
|
|
return isPrimoNotPrimo;
|
|
} |