When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Meixner polynomials - Wikipedia

    en.wikipedia.org/wiki/Meixner_polynomials

    In mathematics, Meixner polynomials (also called discrete Laguerre polynomials) are a family of discrete orthogonal polynomials introduced by Josef Meixner . They are given in terms of binomial coefficients and the (rising) Pochhammer symbol by

  3. Polynomial - Wikipedia

    en.wikipedia.org/wiki/Polynomial

    This is called Euclidean division, division with remainder or polynomial long division and shows that the ring F[x] is a Euclidean domain. Analogously, prime polynomials (more correctly, irreducible polynomials) can be defined as non-zero polynomials which cannot be factorized into the product of two non-constant polynomials.

  4. Descartes' rule of signs - Wikipedia

    en.wikipedia.org/wiki/Descartes'_rule_of_signs

    The rule states that if the nonzero terms of a single-variable polynomial with real coefficients are ordered by descending variable exponent, then the number of positive roots of the polynomial is either equal to the number of sign changes between consecutive (nonzero) coefficients, or is less than it by an even number.

  5. Falling and rising factorials - Wikipedia

    en.wikipedia.org/wiki/Falling_and_rising_factorials

    In mathematics, the falling factorial (sometimes called the descending factorial, [1] falling sequential product, or lower factorial) is defined as the polynomial

  6. Sturm's theorem - Wikipedia

    en.wikipedia.org/wiki/Sturm's_theorem

    In mathematics, the Sturm sequence of a univariate polynomial p is a sequence of polynomials associated with p and its derivative by a variant of Euclid's algorithm for polynomials. Sturm's theorem expresses the number of distinct real roots of p located in an interval in terms of the number of changes of signs of the values of the Sturm ...

  7. Euclid's lemma - Wikipedia

    en.wikipedia.org/wiki/Euclid's_lemma

    The two first subsections, are proofs of the generalized version of Euclid's lemma, namely that: if n divides ab and is coprime with a then it divides b. The original Euclid's lemma follows immediately, since, if n is prime then it divides a or does not divide a in which case it is coprime with a so per the generalized version it divides b.

  8. Eisenstein's criterion - Wikipedia

    en.wikipedia.org/wiki/Eisenstein's_criterion

    Consider the polynomial Q(x) = 3x 4 + 15x 2 + 10.In order for Eisenstein's criterion to apply for a prime number p it must divide both non-leading coefficients 15 and 10, which means only p = 5 could work, and indeed it does since 5 does not divide the leading coefficient 3, and its square 25 does not divide the constant coefficient 10.

  9. Negative number - Wikipedia

    en.wikipedia.org/wiki/Negative_number

    By the 12th century, al-Karaji's successors were to state the general rules of signs and use them to solve polynomial divisions. [5] As al-Samaw'al writes: the product of a negative number—al-nāqiṣ (loss)—by a positive number—al-zāʾid (gain)—is negative, and by a negative number is positive. If we subtract a negative number from a ...