/*
process a supplied integer to determine if it is a prime,
if it is, return true, otherwise false
*/

boolean isPrime(int num){ // begin
  int limit = Math.sqrt(num);
  int denum = 2;
  boolean prime = true;

  while (denum <= limit) { // begin while
    if (number % denum == 0)
       prime = false;
    denum++;
  }  // end while
  return prime;
} // end