Java: Compute the sum of the prime numbers till 100

Last update on May 12 2025 13:17:30 (UTC/GMT +8 hours)

Sum of 100 Primes

Write a Java program to Compute the sum of the prime numbers till 100.

Pictorial Presentation:

Sample Solution:

Java Code:

import java.util.*;

public class Exercise66 {
    public static void main(String[] args) {
        // Initialize variables for sum, counter, and the number 'n'
        int sum = 1;
        int ctr = 0;
        int n = 0;

        // Iterate while the counter is less than 100
        while (ctr < 100) {
            n++;

            // Check if the number is odd
            if (n % 2 != 0) {
                // If the number is prime, add it to the sum
                if (is_Prime(n)) {
                    sum += n;
                }
            }

            // Increment the counter
            ctr++;
        }

        // Print the sum of prime numbers up to 100
        System.out.println("\nSum of the prime numbers till 100: " + sum);
    }

    // Check if a number is prime
    public static boolean is_Prime(int n) {
        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }
}

Sample Output:

Sum of the prime numbers till 100: 1060

Flowchart:

For more Practice: Solve these Related Problems:

• Find the sum of the first 200 prime numbers.
• Modify the program to find the sum of prime numbers in a given range.
• Find the product of the first 50 prime numbers.
• Write a program to count how many prime numbers are between 1 and 1000.

Go to:

• Java Basic Programming Exercises Home ↩
• Java Exercises Home ↩

PREV : Custom Modulus.
NEXT : Insert Word in Middle.

Java Code Editor: