//找出5个大于Long.MAX_VALUE的素数
import java.math.BigInteger;
public class CT1018 {
public static void main(String[] args) {
// TODO Auto-generated method stub
int count=0;
String str=Long.MAX_VALUE+"";
BigInteger n=new BigInteger(str);
while(count<5)
{
if(isPrime(n))
{
System.out.print(n+" ");
count++;
}
n=n.add(BigInteger.ONE);
}
}
public static boolean isPrime(BigInteger i) {
for( BigInteger divisor1=new BigInteger("2");divisor1.compareTo(i.divide(new BigInteger("2")))<=0;divisor1=divisor1.add(BigInteger.ONE)) {
if(i.remainder(divisor1).compareTo(BigInteger.ZERO)==0)
//判断是否为素数
return false;
}
return true;
}
}
若有错误,请指正。