Answer to Question 14B-2

// AllPrime(A, n) returns true of all numbers
// in A[0,...,n-1] are prime (and false otherwise).

bool allPrime(const int A[], const int n)
{
  for(int i = 0; i < n; i++)
  {
    if(!isPrime(A[i]))
    {
      return false;
    }
  }
  return true;
}