Answers for "fastest way to check if a number is prime java"

1

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.");
         }
      }
   }
}
Posted by: Guest on October-25-2020
0

Program to check whether the number is prime or not in java

#include <stdio.h>void main(){int value, rem;printf("Enter an int ");scanf("%d", &value);rem = value % 2;if (rem == 0)printf("%d is an even int\n", value);elseprintf("%d is an odd int\n", value);}
Posted by: Guest on July-08-2021

Code answers related to "fastest way to check if a number is prime java"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language