从键盘输入两个整数m,n,找出等于或大于m的前n个素数。
输入样例:
9223372036854775839 2
输出样例:
9223372036854775907
9223372036854775931
import java.math.BigInteger;
import java.util.Scanner;
public class FindPrime{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
BigInteger m=in.nextBigInteger();
int n=in.nextInt();
int count=0;
while(count<n){
if(m.isProbablePrime(100)){
System.out.println(m);
count++;
}
m=m.nextProbablePrime();
}
in.close();
}
}