Advertisement
Deiancom

Prime NumberCheck

Oct 22nd, 2019
165
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.47 KB | None | 0 0
  1. public static void main(String[] args) {
  2.         int num = 29;
  3.         boolean flag = false;
  4.         for(int i = 2; i <= num/2; ++i)
  5.         {
  6.             // condition for nonprime number
  7.             if(num % i == 0)
  8.             {
  9.                 flag = true;
  10.                 break;
  11.             }
  12.         }
  13.         if (!flag)
  14.             System.out.println(num + " is a prime number.");
  15.         else
  16.             System.out.println(num + " is not a prime number.");
  17.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement