Abstract Algebra (Inverse and Euclidian Algorithm)HELP! NOW OR...I WILL DIE!!!!!!!!!!!!!!!!!!!!!
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Abstract Algebra (Inverse and Euclidian Algorithm)HELP! NOW OR...I WILL DIE!!!!!!!!!!!!!!!!!!!!!

Abstract Algebra (Inverse and Euclidian Algorithm)HELP! NOW OR...I WILL DIE!!!!!!!!!!!!!!!!!!!!!

[From: ] [author: ] [Date: 11-10-29] [Hit: ]
(x^2 + x)^(-1) = 1/2 in Q[x]/.I hope this helps!......
Compute the inverse of the following. Use the Euclidian algorithm.
(x2 + x)-1 mod (x − 1)Q[x]

-
By Euclidean Algorithm in Q[x],
x^2 + x = (x + 2)(x - 1) + 2.

So, x^2 + x = 2 mod.
==> (x^2 + x)^(-1) = 1/2 mod.

That is, (x^2 + x)^(-1) = 1/2 in Q[x]/.

I hope this helps!
1
keywords: and,WILL,Algebra,Euclidian,NOW,DIE,OR,Algorithm,HELP,Inverse,Abstract,Abstract Algebra (Inverse and Euclidian Algorithm)HELP! NOW OR...I WILL DIE!!!!!!!!!!!!!!!!!!!!!
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .