Java Program To Find Prime Numbers

Here's a Java program to find prime numbers up to a specified limit:

public class PrimeNumbers {
    public static void main(String[] args) {
        int limit = 100; // Specify the limit
        System.out.println("Prime numbers up to " + limit + ":");

        // Loop through numbers from 2 to the limit
        for (int i = 2; i <= limit; i++) {
            boolean isPrime = true;

            // Check if the number is prime
            for (int j = 2; j <= Math.sqrt(i); j++) {
                if (i % j == 0) {
                    isPrime = false;
                    break;
                }
            }

            // Print the prime number
            if (isPrime) {
                System.out.print(i + " ");
            }
        }
    }
}

This program iterates through numbers from 2 to the specified limit. For each number, it checks if it is divisible by any number from 2 to its square root. If it is not divisible by any of these numbers, then it is considered a prime number and printed.