From 2bb44faafd61ede1aa903544ee3345f4d0e3022b Mon Sep 17 00:00:00 2001
From: MehulKing2009 <151845785+MehulKing2009@users.noreply.github.com>
Date: Mon, 29 Dec 2025 21:09:16 +0530
Subject: [PATCH] Enhance PrimeCheck with BigInteger prime verification

Added a method to verify prime numbers using BigInteger's isProbablePrime (Safest).
---
 .../java/com/thealgorithms/maths/Prime/PrimeCheck.java     | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/src/main/java/com/thealgorithms/maths/Prime/PrimeCheck.java b/src/main/java/com/thealgorithms/maths/Prime/PrimeCheck.java
index 91c490f70aef..baf53edc5c3f 100644
--- a/src/main/java/com/thealgorithms/maths/Prime/PrimeCheck.java
+++ b/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();
     }