Modular arithmetic with Fermat and Euler | Data Structures in Mathematics Math Foundations 197

Описание: There are two important theorems that make the job of understanding powers in modular arithmetic much simpler. These go back to Fermat and Euler. We apply these to the nice problem of deciding z mod 13. Fermat's result helps us understand powers to a prime modulus. Euler's result relies on understanding the interesting Euler phi function, and is a generalization of Fermat's. As usual we like to illustrate theorems with explicit examples.

************************
Screenshot PDFs for my videos are available at the website http://wildegg.com. These give you a concise overview of the contents of the lectures for various Playlists: great for review, study and summary.

My research papers can be found at my Research Gate page, at https://www.researchgate.net/profile/...

My blog is at http://njwildberger.com/, where I will discuss lots of foundational issues, along with other things.

Online courses will be developed at openlearning.com. The first one, already underway is Algebraic Calculus One at https://www.openlearning.com/courses/... Please join us for an exciting new approach to one of mathematics' most important subjects!

If you would like to support these new initiatives for mathematics education and research, please consider becoming a Patron of this Channel at   / njwildberger   Your support would be much appreciated.

Here are the Insights into Mathematics Playlists:

   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист  
   • Плейлист