Prime Finder

import java.util.ArrayList;
public class Prime_Counter {
	static ArrayList<Integer> primes = new ArrayList<Integer>();
	static int target = 10001;

	public static void main(String[] args) {
		primes.add(2);

		while (primes.size() != target){
			next();
		}// end of primes while

		System.out.println("" + primes.get(primes.size()-1) + " is the " + target + " prime.");
	}

	public static void next(){
		int largestPrime = primes.get(primes.size()-1);
		int z = largestPrime;
		boolean found = false;

		while (!found){
			z++;
			if (prime(z))
			{
				found = true;
				System.out.println("" + z +" is prime.");
				primes.add(z);
			}
		}// end of y while loop
	}// end of next

	public static boolean prime(int x){
		System.out.println("Is " + x +" prime?");
		for (int y = 2; y <= Math.pow(x, 0.5); y++){
			if (x%y == 0)
			{
				System.out.println("" + x +" is not prime.");
				return false;
			}
		}// end of for y loop
		return true;
	}// end of prime
}// end of class