1public class Prime {
2 public static void main(String[] args) {
3
4 int num = 29;
5 boolean flag = false;
6 for(int i = 2; i <= num/2; ++i){
7 if(num % i == 0){
8 flag = true;
9 break;
10 }
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}}
1public class Prime {
2 public static void main(String[] args) {
3
4 int num = 29;
5 boolean flag = false;
6 for(int i = 2; i <= num/2; ++i){
7 if(num % i == 0){
8 flag = true;
9 break;
10 }
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}}
18Source:www.progra
19
1public class Prime {
2
3 public static void main(String[] args) {
4
5 int num = 29;
6 boolean flag = false;
7 for(int i = 2; i <= num/2; ++i)
8 {
9 // condition for nonprime number
10 if(num % i == 0)
11 {
12 flag = true;
13 break;
14 }
15 }
16
17 if (!flag)
18 System.out.println(num + " is a prime number.");
19 else
20 System.out.println(num + " is not a prime number.");
21 }
22}
1public class Prime {
2 public static boolean isPrime(int num) {
3 if (num<2)
4 return false;
5 for(int i=3;i<=Math.sqrt(num);i+=2)
6 if(num%i==0)
7 return false ;
8 return true ;
9 }
10}