Bruteforce Prime finder in java

BrutePrime.java

public class BrutePrime {

	public static void main(String[] args) {
		final int END_VALUE = 1000000;
		
		for(int number=2;number<END_VALUE;number++){
			boolean isPrime = true;
			
			//check divisors to see isPrime
			for(int divisor=2;divisor<number;divisor++){
				if(number % divisor ==0){
					isPrime = false;
					break;
				}
			}
			//isPrime, output
			if(isPrime == true){
				System.out.println(number);
			}
		}			
	}
}