prime check java
static boolean isPrime(int n){ boolean result=true; if(n <= 1) return false; for(int i = 2; i <= n/2; i++){ //n/2 because the largest factor of any number is either it's half or less than it if(n % i == 0){ result = false; //if some number divides it, then prime=false; break; } } return result; }