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

We prove Fermat's theorem a^p = a mod p. We then define the order of a number mod p and use Fermat's theorem to show the order of a divides p-1. We apply this to testing some Fermat and Mersenne numbers to see if they are primes.




For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H
Theory of numbers: Fermats theoremDedekind domains: IntroductionLie groups: Baker Campbell Hausdorff formulaQuestions  and Answers 1Rings and midules 3: Burnside ring and rings of differential operatorsIntroduction to number theory lecture 21. Congruences modulo a prime.Introduction to number theory lecture 9: CongruencesIntroduction to number theory lecture 23. Primitive roots.Complex analysis: Exp, log, sin, cosIntroduction to number theory lecture 1.Galois theory: Primitive elementsComplex analysis: Residue calculus
Richard E Borcherds |

Theory of numbers: Fermat's theorem

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER