Sum of Prime Numbers up to N
This program calculates the sum of prime numbers up to 30.
Problem Statement
Write a Java program that calculates the sum of prime numbers up to 30 using for loop.
Source Code
| 1 | public class SumPrimeSeries { |
| 2 | public static void main(String[] args) { |
| 3 | int sum = 0; |
| 4 | for(int num=2; num<=30; num++) { |
| 5 | boolean prime = true; |
| 6 | for(int i=2; i<=num/2; i++) { |
| 7 | if(num % i == 0) { |
| 8 | prime = false; |
| 9 | break; |
| 10 | } |
| 11 | } |
| 12 | if(prime) sum += num; |
| 13 | } |
| 14 | System.out.println("Sum of primes = " + sum + " - Eduinq"); |
| 15 | } |
| 16 | } |
Program Output
Sum of primes = 129 - Eduinq
Explanation
The program iterates numbers 2 to 30, checks primality, and adds primes to sum. This demonstrates nested loops for prime series summation. Shows how for loop can calculate sum of prime series.