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/FindingPrimes.java

@@ -1,13 +1,10 @@
-public class FindingPrimes
-{
-    public static void main(String[] args)
-    {
+public class FindingPrimes {
+    public static void main(String[] args) {
         int currentNumber = 2; //Number analyzed
         int maxNumber = 20; //Maximum value to be checked
 
         //Main loop that goes from 2 to 20
-        while(currentNumber <= maxNumber)
-        {
+        while(currentNumber <= maxNumber) {
             //Loop that checks all integers from 2 to the current number (starts with 2, ends with 20)
             for (int divisor = 2; divisor <= currentNumber; divisor++) {
                 //We know that the number is prime if it already checked all previous divisors
@@ -25,4 +22,4 @@ public static void main(String[] args)
             currentNumber++;
         }
     }
-}
+}