Answers for "how to check primes java"

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;
    }

how to check if number prime in java

public class PrimeNumberInJava
{
   public static void main(String[] args)
   {
      int a, b = 0, flag = 0;
      int number = 17;
      b = number / 2;
      if(number == 0 || number == 1)
      {
         System.out.println(number + " is not prime number");
      }
      else
      {
         for(a = 2; a <= b; a++)
         {
            if(number % a == 0)
            {
               System.out.println(number + " is not prime number.");
               flag = 1;
               break;
            }
         }
         if(flag == 0)
         {
            System.out.println(number + " is prime number.");
         }
      }
   }
}