得到下一个素数的简洁代码

package test;
public class Prime {
private static int prime = 1;
public static void main(String[] args) {
for (int i = 0; i < 100; i++) {
System.out.println(getnextprime());
}
}

public static int getnextprime() {
for (int i = prime + 1;; i++) {
if (isprime(i)){
prime = i;
break;   }
}
return prime; }
public static boolean isprime(int i) {
for (int j = 2; j < Math.sqrt(i) + 1; j++) {
if (i % j == 0)
return false;  }
return true; }
}