Polynomial GCD as a Combination: An Example of Bezout's Identity in Abstract Algebra
This video provides an example of expressing the polynomial gcd as a linear combination using Bezout's identity, demonstrated through the extended Euclidean algorithm for polynomials.
Michael Penn
31.7K views • Apr 22, 2020
About this video
We give an example of Bezout's identity in polynomials. This involves the extended Euclidean algorithm for polynomials.
Please Subscribe: https://www.youtube.com/michaelpennmath?sub_confirmation=1
Personal Website: http://www.michael-penn.net
Randolph College Math: http://www.randolphcollege.edu/mathematics/
Research Gate profile: https://www.researchgate.net/profile/Michael_Penn5
Google Scholar profile: https://scholar.google.com/citations?user=W5wkSxcAAAAJ&hl=en
Please Subscribe: https://www.youtube.com/michaelpennmath?sub_confirmation=1
Personal Website: http://www.michael-penn.net
Randolph College Math: http://www.randolphcollege.edu/mathematics/
Research Gate profile: https://www.researchgate.net/profile/Michael_Penn5
Google Scholar profile: https://scholar.google.com/citations?user=W5wkSxcAAAAJ&hl=en
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
31.7K
Likes
709
Duration
19:48
Published
Apr 22, 2020
User Reviews
4.7
(6) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now