How Computers Generate Massive Primes In Seconds | Miller-Rabin Primality Test

Support me on Patreon!   / purplemindcs  
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.

This is a video about how computers generate huge prime numbers, and why one of the most commonly used algorithm to do so (called the Miller-Rabin Primality Test) can only be 99.9999...% confident that the numbers it generates 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!

Brittle Rille - Reunited by Kevin MacLeod is licensed under a Creative Commons Attribution 4.0 license. https://creativecommons.org/licenses/...

Math animations are made using Manim, by 3Blue1Brown.
Character animation done by Divyesh Patel.

Discord Server:   / discord  . Feel free to join!
Business Inquiries: purplemindcs@gmail.com