enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Rational root theorem - Wikipedia

    en.wikipedia.org/wiki/Rational_root_theorem

    The theorem is used to find all rational roots of a polynomial, if any. It gives a finite number of possible fractions which can be checked to see if they are roots. If a rational root x = r is found, a linear polynomial ( x – r ) can be factored out of the polynomial using polynomial long division , resulting in a polynomial of lower degree ...

  3. Hilbert's Nullstellensatz - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_Nullstellensatz

    In mathematics, Hilbert's Nullstellensatz (German for "theorem of zeros", or more literally, "zero-locus-theorem") is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic geometry. It relates algebraic sets to ideals in polynomial rings over algebraically closed fields.

  4. Real-root isolation - Wikipedia

    en.wikipedia.org/wiki/Real-root_isolation

    Obreschkoff–Ostrowski theorem: in blue and yellow, the regions of the complex plane where there should be no root for having 0 or 1 sign variation; on the left the regions excluded for the roots of p, on the right, the regions excluded for the roots of the transformed polynomial q; in blue, the regions that are excluded for having one sign ...

  5. Factorization of polynomials - Wikipedia

    en.wikipedia.org/wiki/Factorization_of_polynomials

    For univariate polynomials over the rationals (or more generally over a field of characteristic zero), Yun's algorithm exploits this to efficiently factorize the polynomial into square-free factors, that is, factors that are not a multiple of a square, performing a sequence of GCD computations starting with gcd(f(x), f '(x)). To factorize the ...

  6. Geometrical properties of polynomial roots - Wikipedia

    en.wikipedia.org/wiki/Geometrical_properties_of...

    Root-finding of polynomials – Algorithms for finding zeros of polynomials; Square-free polynomial – Polynomial with no repeated root; Vieta's formulas – Relating coefficients and roots of a polynomial; Cohn's theorem relating the roots of a self-inversive polynomial with the roots of the reciprocal polynomial of its derivative.

  7. Descartes' rule of signs - Wikipedia

    en.wikipedia.org/wiki/Descartes'_rule_of_signs

    In particular, when the number of sign changes is zero or one, then there are exactly zero or one positive roots. A linear fractional transformation of the variable makes it possible to use the rule of signs to count roots in any interval. This is the basic idea of Budan's theorem and the Budan–Fourier theorem. Repeated division of an ...

  8. Zero of a function - Wikipedia

    en.wikipedia.org/wiki/Zero_of_a_function

    In various areas of mathematics, the zero set of a function is the set of all its zeros. More precisely, if f : X → R {\displaystyle f:X\to \mathbb {R} } is a real-valued function (or, more generally, a function taking values in some additive group ), its zero set is f − 1 ( 0 ) {\displaystyle f^{-1}(0)} , the inverse image of { 0 ...

  9. Thomae's function - Wikipedia

    en.wikipedia.org/wiki/Thomae's_function

    Their ratio is a rational number, and typically distributed similarly to Thomae's function. If pairs of positive integers m , n {\displaystyle m,n} are sampled from a distribution f ( n , m ) {\displaystyle f(n,m)} and used to generate ratios q = n / ( n + m ) {\displaystyle q=n/(n+m)} , this gives rise to a distribution g ( q ) {\displaystyle ...