function primeTester (n) {
 //take out edge case 0 and 1
 if(n<=1) 
 return false;
  
 //go from 3 since 2 is a prime number
 for(var i=3; i<n; i++){
   //check if n is divisible by i
   if(n%i ===0 ) 
   return false
 }
 
 //if passed all out test
 return true;
}