Приклади вживання Monic Англійська мовою та їх переклад на Українською
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
Is equivalent to the monic equation.
Therefore, a monic polynomial has the form.
In the case of rational functions the denominatorcould similarly be required to be a monic polynomial.[8].
Notably, the product of monic polynomials again is monic.
Monic Convergence. This was a multidimensional, co-created.
Actually, since the constant polynomial 1 is monic, this semigroup is even a monoid.
The roots of monic polynomial with integer coefficients are called algebraic integers.
These formulae allow one to express the coefficients of monic polynomials in terms of the Bell polynomials of its zeroes.
Thus, the monic polynomials form a multiplicative semigroup of the polynomial ring A[x].
In this manner, then, any non-trivial polynomial equation p(x)=0 may be replaced by an equivalent monic equation q(x)= 0.
Ordinarily, the term monic is not employed for polynomials of several variables.
In that case, this order defines a highest non-vanishing term in p,and p may be called monic, if that term has coefficient one.
A monic polynomial equation with integer coefficients cannot have other rational solutions than integer solutions.
The restriction of the divisibility relation to the set of all monic polynomials(over the given ring) is a partial order, and thus makes this set to a poset.
Monic multivariate polynomials" according to either definition share some properties with the"ordinary"(univariate) monic polynomials.
Here the term cnxn is called the leading term, and its coefficient cn the leading coefficient; if the leading coefficient is 1,the univariate polynomial is called monic.
But p(x, y) is not monic as an element in R[x][y], since then the highest degree coefficient(i.e., the y2 coefficient) is 2x- 1.
There is an alternative convention, which may be useful e.g. in Gröbner basis contexts:a polynomial is called monic, if its leading coefficient(as a multivariate polynomial) is 1.
In algebra, a monic polynomial is a single-variable polynomial(that is, a univariate polynomial) in which the leading coefficient(the nonzero coefficient of highest degree) is equal to 1.
In general, assume that A is an integral domain, and also a subring of the integral domain B. Consider the subset C of B, consisting of those B elements,which satisfy monic polynomial equations over A:.
Is monic, considered as an element in R[y][x], i.e., as a univariate polynomial in the variable x, with coefficients which themselves are univariate polynomials in y:.
In other words, assume that p= p(x1,…,xn) is a non-zero polynomial in n variables, andthat there is a given monomial order on the set of all("monic") monomials in these variables, i.e., a total order of the free commutative monoid generated by x1,…, xn, with the unit as lowest element, and respecting multiplication.
The solutions to monic polynomial equations over an integral domain are important in the theory of integral extensions and integrally closed domains, and hence for algebraic number theory.
The set of all monic polynomials(over a given(unitary) ring A and for a given variable x) is closed under multiplication, since the product of the leading terms of two monic polynomials is the leading term of their product.
If p is a prime number, the number of monic irreducible polynomials of degree n over a finite field G F( p){\displaystyle GF(p)} with p elements is equal to the necklace counting function N p( n){\displaystyle N_{p}(n)}.[citation needed].
The properties of monic polynomials and of their corresponding monic polynomial equations depend crucially on the coefficient ring A. If A is a field, then every non-zero polynomial p has exactly one associated monic polynomial q; actually, q is p divided with its leading coefficient.