private static boolean isPrime(int n) {
		
		boolean result = true;  // assume true and try to prove otherwise
		int i=2;
		while ((i<n) && (result == true)) {
			if ((n%i) == 0) {
				result = false;
			}
			i++;
		}		
		return result;
		
	}