Check Prime Number
This program checks if a number is prime using for loop.
Problem Statement
Write a Java program that checks if 29 is prime using for loop.
Source Code
| 1 | public class PrimeCheck { |
| 2 | public static void main(String[] args) { |
| 3 | int num = 29; |
| 4 | boolean prime = true; |
| 5 | for(int i=2; i<=num/2; i++) { |
| 6 | if(num % i == 0) { |
| 7 | prime = false; |
| 8 | break; |
| 9 | } |
| 10 | } |
| 11 | if(prime) { |
| 12 | System.out.println(num + " is prime - Eduinq"); |
| 13 | } else { |
| 14 | System.out.println(num + " is not prime - Eduinq"); |
| 15 | } |
| 16 | } |
| 17 | } |
Program Output
29 is prime - Eduinq
Explanation
The program checks divisibility of num by numbers from 2 to num/2. If divisible, it sets prime=false and breaks the loop. Otherwise, it remains true. This demonstrates how for loops can check prime numbers efficiently. Shows how for loop can check prime numbers.