Random Primality Test (Prime Adventure Part 9)

Channel:
Canada Art of the Problem
Subscribers:
175,000
Published on ● Video Link: https://www.youtube.com/watch?v=mTSdmDm0gRU


Duration: 5:06
7,309 views
24

Introduction to random primality tests & how they will work (warm up). I setup a simple division which is not very efficient since it requires many trials. Though we can use this same concept to build much more efficient tests. We just need a new equation!

Follow along here:
https://www.khanacademy.org/math/applied-math/cryptography/random-algorithms-probability/p/level-9-trial-divison-vs-random-division



Other Videos By Art of the Problem


2014-01-08Information Theory part 14: Error correction codes (Hamming coding)
2014-01-05Information Theory part 13: Data Compression via Huffman Coding
2013-11-27Claude Shannon's Information Entropy | Information Theory Part 12
2013-06-27Information Theory part 11: Claude Shannon: A Mathematical Theory of Communication
2013-06-26Information Theory part 10: What is a Markov chain?
2013-05-31Information Theory part 9: What is a bit?
2013-05-20Fermat primality test (Prime Adventure Part 10)
2013-04-08Intro to Channel Capacity (information theory)
2013-04-08Symbol Rate (information theory)
2013-04-05Information Theory part 8: Channel capacity (baud rate)
2013-03-12Random Primality Test (Prime Adventure Part 9)
2013-03-12Random Primality Tests (Prime Adventure part 9)
2013-03-07Fermat's Little Theorem (Visualization)
2013-03-02Information Theory part 7: Morse Code
2013-02-21RSA Encryption (step 5)
2013-02-21RSA Encryption (step 2)
2013-02-21RSA Encryption (step 3)
2013-02-21Diffie-Hellman Key Exchange (part 2)
2013-02-21Computational Number Theory (Prime Adventure part 1)
2013-02-21Intro to RSA Encryption (step 1)
2013-02-21Diffie-Hellman Key Exchange (part 1)


Tags:
random primality test
History Of Science
Educational Webseries