Let f=Xn−1 and g=Xm−1 be two polynomials. Show that:
(f,g)=X(n,m)−1,
where (a,b)= greatest common divisor of a and b.
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection f:A→B and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...
-
Recently I took a test where I was given these two limits to evaluate: limh→0sin(x+h)−sin(x)h and $\lim_\limi...
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I need to give an explicit bijection between (0,1] and [0,1] and I'm wondering if my bijection/proof is correct. Using the hint tha...
No comments:
Post a Comment