Theory of numbers: Prime tests @richarde.borcherds7998
Theory of numbers: Prime tests  @richarde.borcherds7998
Uploaded January 2021 | Updated November 2026, 3 hours ago
This lecture is part of an online undergraduate course on the theory of numbers.

We describe how to use Fermat's theorem as a test to see if numbers n are not prime, by checking to see if a^n=a mod n for various numbers a. We then given an example of a "Carmichael number": a composite number that passes this probabilistic test for primeness.




For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H
Theory of numbers: Prime testsTheory of numbers: Chevalley-Warning theoremModular forms: Theta functionsIntroduction to number theory lecture 45 Dirichlet seriesElliptic functions lecture 3. Jacobi functionsP=NP?Theory of numbers: RSA cryptographyIntroduction to number theory lecture 39: Equivalence of binary quadratic formsIntroduction to number theory lecture 24. Primitive roots for prime powersRings 9 Projective modulesAlgebraic topology: Calculating the fundamental groupComplex analysis: Arithmetic
Richard E Borcherds |

Theory of numbers: Prime tests

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER