feat: Identify and print prime numbers from 2 to 20 using nested loops

🔍 Logic:
- Outer loop increments through numbers 2 to 20.
- Inner loop checks divisibility from 2 to current number.
- If `divisor == currentNumber`, it means no smaller divisor was found → prime.
- If divisible earlier, print "NOT a prime" and exit inner loop early.

🛠️ Note:
`break` should be used after detecting a non-prime to skip unnecessary checks.

Signed-off-by: Somesh diwan <[email protected]>

Author: Someshdiwan

Section7ConditionalStatements/Loops/src/FindPrimeNumbers.java

@@ -0,0 +1,24 @@
+public class FindPrimeNumbers {
+    public static void main(String[] args) {
+        int currentNumber = 2; // Number to analyze
+        int maxNumber = 20;    // Max value to check
+
+        while (currentNumber <= maxNumber) {
+            boolean isPrime = true;
+
+            for (int divisor = 2; divisor <= currentNumber / 2; divisor++) {
+                if (currentNumber % divisor == 0) {
+                    System.out.println(currentNumber + " is NOT a prime number!");
+                    isPrime = false;
+                    break; // No need to check further, already found a divisor
+                }
+            }
+
+            if (isPrime) {
+                System.out.println(currentNumber + " is a prime number!");
+            }
+
+            currentNumber++;
+        }
+    }
+}