Enhance PrimeCheck with BigInteger prime verification

Added a method to verify prime numbers using BigInteger's isProbablePrime (Safest).

Author: MehulKing2009

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

@@ -1,5 +1,6 @@
 package com.thealgorithms.maths.Prime;
 
+import java.math.BigInteger;
 import java.util.Scanner;
 
 public final class PrimeCheck {
@@ -22,6 +23,12 @@ public static void main(String[] args) {
         } else {
             System.out.println("algo2 verify that " + n + " is not a prime number");
         }
+
+        if (BigInteger.valueOf(n).isProbablePrime(100)){ // uses Miller–Rabin and Lucas probable prime test (Baillie–PSW)
+            System.out.println("algo3 verify that " + n + " is a prime number");
+        } else {
+            System.out.println("algo3 verify that " + n + " is not a prime number");
+        }
         scanner.close();
     }