isPrime

by trentHarlem

JavaScript

// Find Prime Numbers.
// what are primes? integers divible by themselves and 1.
//0,1 are not primes
// 2 is a prime. ALL other even #'s are Not

//primes to 101
const primes101 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101]
const notPrimes = [1,4,6,8,10,12,14,16]



// needs if statement to handle 0,1,and 2 cases
const isPrime = (x) => (x%x+1 === 1 && x / 1 === x && x%2!==0) ? true : false

primes101.filter(num => isPrime)
console.log(primes101.filter(num => isPrime))
console.log(notPrimes.filter(num => isPrime))
console.log(isPrime(101))
console.log(isPrime(73))
console.log(isPrime(100))
console.log(isPrime(32))
/* console.log(isPrime(4))
console.log(isPrime(17))
console.log(isPrime(18))
console.log(isPrime(43))  */