Unique factorization and its difficulties I Data Structures in Mathematics Math Foundations 198

Описание: The Unique Factorization Theorem is also called the Fundamental Theorem of Arithmetic: the existence and uniqueness of a prime factorization for a natural number n. It is a pillar of number theory, and goes back to Euclid. We want to have a look at the logical structure of this theorem.

In this video we look at both the existence and uniqueness sides of the argument. Along the way, we will have a first look at some (smallish) primes. We also discuss Bezout's Identity, a useful consequence of the Euclidean algorithm.

************************
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:

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