import java.util.Scanner;
public class Test2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数字n:");
int n = sc.nextInt();
System.out.println("大于" + n + "的最小质数为:" + printPrime(n));
}
public static int printPrime(int n) {
while (true) {
n++;
boolean flag = isPrime(n);
if (flag) {
break;
}
}
return n;
}
public static boolean isPrime(int n) {
for (int i = 2; i < n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
编写一个方法,输出大于某个正整数n的最小的质数。import java.util.Scanner;public class Test2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("请输入数字n:"); int n = sc.nextInt(); System.out.pr