function isPrime(x)
{
  if (x<2)   return 0;
  candidate = 2;
  while (candidate < x)
    {
       if ( (x % candidate) == 0 )   
          return 0;
       candidate = candidate +1;

   }
  return 1;
}



function allPrimesLessThan(y)
{
   count = 0;
   num = 2;
   while (num < y)
   {
      status = isPrime(num);
      if ( status )
      {
         count = count +1;
         display num, " is a prime.";
      }
      num = num+1;
   }
   return count;
}
