Java、大素数

编写程序找出五个大于Long.Max_VALUE的素数。

---

package pack2;

import java.math.BigInteger;

public class SquareNumber {

	public static void main(String[] args) {
		binPrimeNumber();
	}
	
	/**大素数*/
	public static void binPrimeNumber() {
		BigInteger integer = new BigInteger(Long.MAX_VALUE + "");
		int count = 0;
		
		while(true) {
			integer = integer.add(BigInteger.ONE);
			if(isPrime(integer)) {
				System.out.println(integer);
				count++;
			}
			if(count == 5) break;
		}
	}
	
	/**判断是否为素数？*/
	private static boolean isPrime(BigInteger integer) {
		for (BigInteger i = new BigInteger("2"); i.compareTo(new BigInteger("" +
				(int)(Math.sqrt(Double.valueOf(integer.toString()))))) < -1; i = 
                 i.add(BigInteger.ONE)) 
			if(integer.divide(i) == BigInteger.ZERO)
				return false;
		return true;
	}
}

---