Understanding Prime Number Imposters

Probabilistic tests are among the most efficient ways to generate primes. However, they're susceptible to pseudoprimes, composites for which the test outputs probably prime. This is my entry in #SoME4

Join my discord!
https://discord.gg/xNcKuDugCY

Where I got my data for the running time comparison:
https://i.sstatic.net/IOuiJ.png
https://stackoverflow.com/questions/3336642/what-are-typical-runtimes-for-miller-rabin-primality-testing
https://pari.math.u-bordeaux.fr/Events/PARI2018/talks/ecpp.pdf
https://www.ccs.neu.edu/home/mates/files/primes_report.pdf
https://maths-people.anu.edu.au/~brent/pd/primality4.pdf
https://www.jsr.org/hs/index.php/path/article/view/3860/1589

Chapters:
0:00 Intro
1:43 gcd
3:36 Modular arithmetic
8:39 Exponentiation
13:36 Fermat test
21:55 Euler test
26:27 Miller Rabin test
36:08 Comparison
39:52 outro

#math #numbers #amongus