Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture discusses polynomial rings, focusing on their similarity to integers and fields. It covers the concept of irreducibility in polynomial rings, including criteria such as degree, Eisenstein criterion, and finite fields. The instructor explains how to find greatest common divisors and irreducible polynomials, emphasizing the importance of these concepts in algebraic structures.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace