package com.anuragkapur.misc;
/**
* @author anuragkapur
*/
public class PrimeNumber {
public boolean isPrime(int n) {
if (n == 2) {
return true;
}
if (n % 2 == 0) {
return false;
}
for (int i=3; i<=Math.sqrt(n); i+=2) {
if (n % i == 0) {
return false;
}
}
return true;
}
}