Check Whether a Number is Prime or Not. Java

#java #loop

Check Prime Number using a for loop

Java

xxxxxxxxxx
 
public class Main {
​
  public static void main(String[] args) {
​
    int num = 29;
    boolean flag = false;
    for (int i = 2; i <= num / 2; ++i) {
      if (num % i == 0) {
        flag = true;
        break;
      }
    }
​
    if (!flag)
      System.out.println(num + " is a prime number.");
    else
      System.out.println(num + " is not a prime number.");
  }
}

Output result

29 is a prime number.

Check Prime Number using a while loop

Java

xxxxxxxxxx
 
public class Main {
​
  public static void main(String[] args) {
​
    int num = 33, i = 2;
    boolean flag = false;
    while (i <= num / 2) {
      if (num % i == 0) {
        flag = true;
        break;
      }
​
      ++i;
    }
​
    if (!flag)
      System.out.println(num + " is a prime number.");
    else
      System.out.println(num + " is not a prime number.");
  }
}

Output result

33 is not a prime number.

Java

code examples and answer to questions in Java programming luaguage

Check Whether a Number is Prime or Not. Java

Java

Hot Network Questions

BeeCoder.ORG

open source code and examples