Better way to check a number for Prime. Update PrimeCheck.java

The function does this by 
1. Skip even numbers (except 2) since they are not prime.
2. Skip multiples of 3 after checking 3.
3. Start checking for factors from 5 and use the 6k ± 1 optimization. This is based on the fact that any prime number greater than 3 can be expressed as 6k ± 1.

This helps to make it much more efficient for large numbers.

Author: ZingadePrathamesh

src/main/java/com/thealgorithms/maths/PrimeCheck.java

@@ -22,6 +22,12 @@ public static void main(String[] args) {
         } else {
             System.out.println("algo2 verify that " + n + " is not a prime number");
         }
+
+        if (isPrimeNumberOptimised(Long.MAX_VALUE)) {
+            System.out.println("algo4 verify that " + Long.MAX_VALUE  + " is a prime number");
+        } else {
+            System.out.println("algo4 verify that " + Long.MAX_VALUE  + " is not a prime number");
+        }
         scanner.close();
     }
 
@@ -82,4 +88,28 @@ private static long modPow(long a, long b, long c) {
         }
         return res % c;
     }
+
+    /**
+     * Checks if a given number is prime using an optimized approach.
+     * 
+     * @param number the number to check
+     * @return true if the number is prime, false otherwise
+     */
+    public static boolean isPrimeNumberOptimised(long number) {
+        // Numbers less than or equal to 1 are not prime
+        if (number <= 1) return false;
+        // Numbers 2 and 3 are prime
+        if (number <= 3) return true;
+        // Eliminate even numbers and multiples of 3
+        if (number % 2 == 0 || number % 3 == 0) return false;
+        // Check for factors from 5 onwards using the 6k ± 1 optimization
+        for (long i = 5; (i * i) <= number; i += 6) {
+            // Check if the number is divisible by i or (i + 2)
+            if (number % i == 0 || number % (i + 2) == 0) {
+                return false;
+            }
+        }
+        // If no factors are found, the number is prime
+        return true;
+    }
 }