除了1和本身,不存在整除的数,最小的素数是2
public class PrimeNum {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Please input a number!");
int a = scan.nextInt();
for(int i = 2; i <= a; i++){
if(a % i == 0 && i != a){
System.out.println(a + "不是素数");
break;
}else if(a == i){
System.out.println(a + "是素数!");
}
}
}
}