MHB GCDs of Polynomials: Reading Rotman's Corollary 3.58

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Polynomials
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Joseph J.Rotman's book, A First Course in Abstract Algebra.

I am currently focused on Section 3.5 From Polynomials to Numbers

I need help with the statement and meaning of Corollary 3.58

The relevant section of Rotman's text reads as follows:https://www.physicsforums.com/attachments/4547In the above text (in the statement of the Corollary) we read the following:

" ... ... (ii) Every two polynomials $$f(x)$$ and $$g(x)$$ have a unique gcd. ... ... "
My question (which some may regard as pedantic :) ) is as follows:

Does Rotman actually mean ...

" (ii) Every two polynomials $$f(x)$$ and $$g(x)$$ have a unique monic gcd. ... ... "

Can someone please confirm that my interpretation is correct?

Peter
 
Physics news on Phys.org
Peter said:
I am reading Joseph J.Rotman's book, A First Course in Abstract Algebra.

I am currently focused on Section 3.5 From Polynomials to Numbers

I need help with the statement and meaning of Corollary 3.58

The relevant section of Rotman's text reads as follows:In the above text (in the statement of the Corollary) we read the following:

" ... ... (ii) Every two polynomials $$f(x)$$ and $$g(x)$$ have a unique gcd. ... ... "
My question (which some may regard as pedantic :) ) is as follows:

Does Rotman actually mean ...

" (ii) Every two polynomials $$f(x)$$ and $$g(x)$$ have a unique monic gcd. ... ... "

Can someone please confirm that my interpretation is correct?

Peter
I think gcd is defined to a monic by default. Please check the definition in the book. If it doesn't say monic specifically then yes, you can have many gcds.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top