private boolean isPrime(int value) {
		/* Try all possible divisors of the number.  If any of them
		 * cleanly divide the number, we return that the number is
		 * composite.
		 */
		for (int divisor = 2; divisor < value; divisor++) {
			int remainder = value % divisor;
			if (remainder == 0) {
				return false;
			}
		}
		return true;
	}