@@ -0,0 +1,1262 @@
+// Test the primeness of a number%0A%0A// input: number%0A// output: boolean value%0A%0A// - A number is prime when only divisible by 1 and itself%0A// - Enter a number that loops n being divided from n-1 until 2%0A// - use a conditional that uses a modulus that stops if at any point n%25x = 0, console log that the number is a prime%0A%0A%0Avar prime = function(number)%7B%0A  primeness = true;%0A  floatTest = number.toString();%0A%0A  //take care of your outliers%0A  if(number === 1 %7C%7C number === 2)%7B%0A    console.log(number+%22 is prime%22)%0A  %7Delse if(number %3C= 0)%7B%0A    console.log(%22Please enter a whole number greater than zero%22)%0A  %7Delse if(floatTest.indexOf(%22.%22) %3E 0)%7B%0A    console.log(%22Please enter a whole number greater than zero%22)%0A  %7Delse%7B%0A    // evaluate the primeness%0A    for (var i=(number-1) ; i %3E 1 ; i-- )%7B%0A      if (number %25 i !== 0)%7B%0A      // console.log(%22if hit %22+i)%0A        continue%0A      %7Delse if(number %25 i === 0)%7B%0A        primeness = false;%0A      // console.log(%22else if hit %22+i)%0A        break%0A    %7D;%0A  %7D;%0A%0A  // tell the results of your algorithm%0A    if(primeness === false)%7B%0A      console.log(number+%22 is not prime%22)%0A    %7Delse%7B%0A      console.log(number+%22 is prime%22)%0A    %7D;%0A  %7D;%0A%7D;%0A%0A%0Aprime(9);%0Aprime(11);%0Aprime(3337);%0Aprime(1)%0Aprime(2)%0Aprime(-4)%0Aprime(0)%0Aprime(0.1)%0Aprime(12.1)

Complete prime number algorithm