Abstract Algebra | Writing a polynomial gcd as a combination -- example.

We give an example of Bezout's identity in polynomials. This involves the extended Euclidean algorithm for polynomials.

[huntergibson]

Thank you for this, My prof has really checked out with covid and basically just assigns questions from the textbook (which is terrible, I think he wrote it himself, without an editor) There's lots of things in the book that have unexplained examples and this helped immensely. Thank you.

[azfarahsan]

as a person currently studying ntru cryptosystem and struggling, thank you, you practically saved my life

[vindhyachalsingh]

Can u please explain Abel Ruffini insolvability theorem ?

[Jkfgjfgjfkjg]

I'm in awe of your presentation skills.

[muskanyadav]

TYSM its my exam tomorrow and i was literally struggling to get this concept into my head....

[knowledgeuptill]

Sir plz make vedios on complex variable integration....

[rainks]

Thank you very much. I understand very well.

[sukumarrastogi]

i have one doubt... when he started evaluating for for Z11, how did he put 10mod11 equals -1. I tried looking on the internet that whether we can do that or not, im unable to anything similar. Can anyone help me out?

[justnarcisa]

Tidy writing is tidy thinking. Thanks!

[sumeetrathore]

9:39
Why you didn't considered 11/25 ??

[martijnnieuwenhuis]

Next time, please tell if you make a change --> you made a change to f(x) at 2:21

[derendohoda]

I love polynomial arithmetic for some reason. I never find it tedious, it's very relaxing to me.