• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Algorithms for the matrix pth root
Algorithms for the matrix pth root

Math 850 Algebra - San Francisco State University
Math 850 Algebra - San Francisco State University

Computing the sign or the value of the determinant of an integer
Computing the sign or the value of the determinant of an integer

Chapter 8 - U.I.U.C. Math
Chapter 8 - U.I.U.C. Math

... Noetherian, then the ring R[[X]] of formal power series is Noetherian. We cannot simply reproduce the proof because an infinite series has no term of highest degree, but we can look at the lowest degree term. If f = ar X r + ar+1 X r+1 + · · · , where r is a nonnegative integer and ar = 0, let us sa ...
EXERCISES IN MA 510 : COMMUTATIVE ALGEBRA
EXERCISES IN MA 510 : COMMUTATIVE ALGEBRA

Algorithms for Factoring Square-Free Polynomials over
Algorithms for Factoring Square-Free Polynomials over

Totally real origami and impossible paper folding
Totally real origami and impossible paper folding

Chapter 5 Complex numbers - School of Mathematical and
Chapter 5 Complex numbers - School of Mathematical and

Numerical Solution of Fuzzy Polynomials by Newton
Numerical Solution of Fuzzy Polynomials by Newton

Abstract Algebra
Abstract Algebra

... from that to which you are accustomed; so a list of definitions of the terms we use is provided here. • The notation ‘f : A → B’ (read ‘f , from A to B’) means that f is a function with domain A and codomain B. In other words, f is a rule which assigns to every element a of the set A an element in t ...
analytic and combinatorial number theory ii
analytic and combinatorial number theory ii

congruences modulo powers of 2 for the signature of complete
congruences modulo powers of 2 for the signature of complete

Factorization of Polynomials over Finite Fields
Factorization of Polynomials over Finite Fields

Variations on Belyi`s theorem - Universidad Autónoma de Madrid
Variations on Belyi`s theorem - Universidad Autónoma de Madrid

Interactive Formal Verification (L21) 1 Sums of Powers, Polynomials
Interactive Formal Verification (L21) 1 Sums of Powers, Polynomials

Solving Problems with Magma
Solving Problems with Magma

(x). - Montville.net
(x). - Montville.net

Hybrid Model of Fixed and Floating Point Numbers in Secure
Hybrid Model of Fixed and Floating Point Numbers in Secure

[hal-00137158, v1] Well known theorems on triangular systems and
[hal-00137158, v1] Well known theorems on triangular systems and

the arithmetical theory of linear recurring series
the arithmetical theory of linear recurring series

Prime and maximal ideals in polynomial rings
Prime and maximal ideals in polynomial rings

an elementary real-algebraic proof via Sturm chains.
an elementary real-algebraic proof via Sturm chains.

Finite fields Michel Waldschmidt Contents
Finite fields Michel Waldschmidt Contents

Bonus Lecture: Knots Theory and Linear Algebra Sam Nelson In this
Bonus Lecture: Knots Theory and Linear Algebra Sam Nelson In this

Arithmetic Circuits and Identity Testing
Arithmetic Circuits and Identity Testing

< 1 2 3 4 5 6 7 ... 28 >

Resultant

In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (over their field of coefficients). In some older texts, the resultant is also called eliminant.The resultant is widely used in number theory, either directly or through the discriminant, which is essentially the resultant of a polynomial and its derivative. The resultant of two polynomials with rational or polynomial coefficients may be computed efficiently on a computer. It is a basic tool of computer algebra, and is a built-in function of most computer algebra systems. It is used, among others, for cylindrical algebraic decomposition, integration of rational functions and drawing of curves defined by a bivariate polynomial equation.The resultant of n homogeneous polynomials in n variables or multivariate resultant, sometimes called Macaulay's resultant, is a generalization of the usual resultant introduced by Macaulay. It is, with Gröbner bases, one of the main tools of effective elimination theory (elimination theory on computers).
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report