判断一个数是否为素数Java实现

package myJavaLib;
import java.util.Scanner;

public class IsPrime {
	public static boolean isPrime(int n) {
		if (n < 2) // the smallest prime is 2.
			return false;
		
		for (int i = 2; i <= Math.sqrt(n); i++) {
			if (n % i == 0) 
				return false;
		} // else:
		return true;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();	
		System.out.println(isPrime(n));
	}
}