6 июн. 2013 г. · Define the content of a polynomial (over an arbitrary commutative ring A) to be the ideal generated by its coefficients, denoted c(f). I want ...

18 авг. 2019 г. · The content is the greatest common divisor of the coefficients in a gcd domain. It is unique up to units, as the gcd is unique up to units.

4 июн. 2011 г. · The content is the gcd of the coefficients, and gcds are only defined up to associates. Thus "the content is 1" and "the content is a unit" are ...

3 июн. 2012 г. · Content is defined for polynomials over the field of fractions K (including scalars), not over the factorial ring A, though factorisation in A ...

11 янв. 2019 г. · Every polynomial in Q[x] is a product of a constant polynomial and a primitive polynomial.

17 дек. 2020 г. · Let c(f) be a content of a polynomial over Z and a∈Z. Show that c(a⋅f)=a⋅c(f).

23 окт. 2017 г. · Given a UFD R, and F=Frac(R), we can define the content of a polynomial f∈F[X], f=anXn+⋯+a1X+a0, by c(f)=∏p∈Ppvp(f), where vp(f)=min0≤i≤nvp(ai) ...

12 сент. 2016 г. · The content of a nonzero polynomial f∈R[x], denoted contf, is the gcd of its coefficients. As any gcd in an integral domain, it's defined ...

12 апр. 2021 г. · Some properties of the content of a polynomial · For (1), you can clear denominators first and then take the gcd of the resulting (integer) ...

6 июл. 2016 г. · Generalizing concept of content of a polynomial to commutative rings [duplicate] ... Content of a polynomial (2 answers). Closed 8 years ago ...