Prime Series up to N
This program prints prime numbers up to 50 using for loop.
Problem Statement
Write a Java program that prints prime numbers up to 50 using for loop.
Source Code
| 1 | public class PrimeSeries { |
| 2 | public static void main(String[] args) { |
| 3 | for(int num=2; num<=50; num++) { |
| 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 | } |
| 14 | } |
| 15 | } |
| 16 | } |
Program Output
2 is prime - Eduinq 3 is prime - Eduinq 5 is prime - Eduinq ... 47 is prime - Eduinq
Explanation
The outer loop iterates through numbers 2 to 50. The inner loop checks divisibility. If divisible, prime=false. If not divisible, the number is prime. Shows how for loop can generate prime series.