Miller-Rabin Test

The Miller-Rabin test is an algorithm used to determine if a large number is prime. It works by checking specific mathematical properties that prime numbers have, using random "tests" with different numbers. If a number passes these tests, it is very likely prime; if it fails, it’s definitely composite (not prime). Multiple rounds increase confidence. While not foolproof on a single run, the test is efficient and reliable for large numbers, making it useful in cryptography and other applications where identifying prime numbers quickly is essential.