PrimeNumbers.java

public class PrimeNumbers
{

	public final static int MIN = 1;
	public final static int MAX = 1000;

	public static void main(String[] args)
	{

		int count = primeRange(MIN, MAX);
		System.out.println(count + " prime numbers found in the range from " + MIN + " to " + MAX);

	}

	public static int primeRange(int min, int max)
	{
		int counter = 0;
		for (int number = 1; number < max; number += 2)
		{
			if (isPrime(number))
			{
				counter++;
			}

		}
		return counter;
	}

	private static boolean isPrime(int n)
	{
		final int limit = n / 2;
		for (int i = 3; i < limit; i += 2)
		{
			if (n % i == 0)
			{
				return false;
			}
		}
		return true;
	}
}