Search results
Results From The WOW.Com Content Network
Every polynomial with integer coefficients is integer-valued, but the converse is not true. For example, the polynomial = + = (+) takes on integer values whenever t is an integer. That is because one of t and + must be an even number. (The values this polynomial takes are the triangular numbers.) Integer-valued polynomials are objects of study ...
The method uses the fact that evaluating integer polynomials at integer values must produce integers. That is, if f ( x ) {\displaystyle f(x)} is a polynomial with integer coefficients, then f ( a ) {\displaystyle f(a)} is an integer as soon as a is an integer.
Similarly, an integer polynomial is a polynomial with integer coefficients, ... and values. In particular, a polynomial, restricted to have real coefficients, defines ...
This equation has nonzero solutions that are nonsingular on [−1, 1] only if ℓ and m are integers with 0 ≤ m ≤ ℓ, or with trivially equivalent negative values. When in addition m is even, the function is a polynomial. When m is zero and ℓ integer, these functions are identical to the Legendre polynomials.
A seemingly weaker yet equivalent statement to Bunyakovsky's conjecture is that for every integer polynomial () that satisfies (1)–(3), () is prime for at least one positive integer : but then, since the translated polynomial (+) still satisfies (1)–(3), in view of the weaker statement () is prime for at least one positive integer >, so ...
A polynomial with integer coefficients, or, more generally, with coefficients in a unique factorization domain R, is sometimes said to be irreducible (or irreducible over R) if it is an irreducible element of the polynomial ring, that is, it is not invertible, not zero, and cannot be factored into the product of two non-invertible polynomials ...
In mathematics, an integer-valued function is a function whose values are integers.In other words, it is a function that assigns an integer to each member of its domain.. The floor and ceiling functions are examples of integer-valued functions of a real variable, but on real numbers and, generally, on (non-disconnected) topological spaces integer-valued functions are not especially useful.
For any given n ≥ 1, among the polynomials of degree n with leading coefficient 1 (monic polynomials): = is the one of which the maximal absolute value on the interval [−1, 1] is minimal. This maximal absolute value is: 1 2 n − 1 {\displaystyle {\frac {1}{2^{n-1}}}} and | f ( x ) | reaches this maximum exactly n + 1 times at: x = cos ...