MethodsReview

      public static boolean isEven(int n) { return n % 2 == 0; }
public static boolean isOdd(int n)	{ return n % 2 == 1; }
public static boolean isPositive(int n)	{ return n > 0; }
public static boolean isPrime(int n) {
	boolean isPrime = true;
	for(int i = 2; i < n; i++)
		if (n % i == 0)
			isPrime = false;
	return isPrime;
}
public static boolean isATriangle(int numSides) { return numSides == 3; }
public static boolean isEquilateral(int side1, int side2, int side3)
{ return side1 == side2 && side2 == side3; }
public static boolean isRightTriangle(int angle1, int angle2, int angle3)
{ return angle1 == 90 || angle2 == 90 || angle3 == 90; }
public static boolean isVowel(char c) // precondition:  c is lowercase
{	return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u'; }
public static int countVowels(String s) // use isVowel(char c)
{
	int count = 0;
	for(int i = 0; i < s.length() i++)
		if(isVowel(c))	count++;
	return count;
}	
public static boolean isAlphabetic(char c)
{	return ( c >= 'a' & c <= 'z') || ( c >= 'A' & c <= 'Z') ;
public static boolean isConsonant(char c) // Use above methods
{	return isAlphabetic(c) && ! isVowel(c); }
public static double areaSquare(double side1, double side2)
{	return side1 * side2; }
public static double areaCircle(double radius)
{	return Math.PI * Math.pow(radius,2);  }
public static boolean isInRange(int num, int bottom, int top)
{	return n >= bottom && num <= top;  }
public static int sumRange(int bottom, int top) // inclusive
{
	int sum = 0;
	for (int i = bottom; i <= top; i++)
		sum += i;
	return sum;
}
public static int averageRange(int bottom, int top) // inclusive
{
	int count = top - bottom + 1;
	return sumRange(top, bottom) / count;
}
public static int min(int num1, int num2)
{
	if(num1 < num2)
		return num1;
		else
		return num2;
}
public static int max(int num1, int num2)
{
	if(num1 > num2)
		return num1;
		else
		return num2;
}