How To Find Massive Primes in Seconds | Miller-Rabin Primality Test

The Miller-Rabin Primality Test is one of the most commonly-used algorithms that computers use to find massive prime numbers. But one very interesting property it has is that it can only be 99.9999...% confident that the numbers it finds are actually prime! The story behind this test dates back to the 17th century, with a simple theorem proved by the legendary French mathematician, Pierre de Fermat. There are so many amazing pieces of math and techniques that make this all work, and it goes to show that the search for prime numbers is one of the most fascinating problems at the intersection of mathematics and computer science. If you or your institution is interested in sponsoring the topic of a future PurpleMind video, please contact me via purplemindcs@gmail.com! Support me on Patreon! https://www.patreon.com/PurpleMindCreations If you'd like to aid the success of this channel, this is the best way to do it! Every contribution is sincerely, greatly, appreciated. Brittle Rille - Reunited by Kevin MacLeod is licensed under a Creative Commons Attribution 4.0 license. https://creativecommons.org/licenses/by/4.0/ Math animations are made using Manim, by 3Blue1Brown. Character animation done by Divyesh Patel. Discord Server: https://discord.gg/smuxnzZ5Zf. Feel free to join! Business Inquiries: purplemindcs@gmail.com