DEV Community

Discussion on: Daily Challenge Post #20 - Number Check

Collapse
 
jacobmgevans profile image
Jacob Evans • Edited

I made the answer earlier and forgot to put it here after I solved it in CodeWars lmao
JavaScript answer, Big O time complexity of O(sqrt(n)) to find if N is a Prime Number.

const isPrime = num => {
    for(let i = 2, s = Math.sqrt(num); i <= s; i++)
        if(num % i === 0) return false; 
    return num > 1;
}

const numberProperty = n =>  [
   isPrime(n),
   n % 2 === 0,  
   n % 10 === 0,   
];