Search Results for ""

In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...

An extension of the secant method of root finding to higher dimensions.

A field K is said to be algebraically closed if every polynomial with coefficients in K has a root in K.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

A quantity involving primitive cube roots of unity which can be used to solve the cubic equation.

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

An extension F of a field K is said to be algebraic if every element of F is algebraic over K (i.e., is the root of a nonzero polynomial with coefficients in K).

An equation of the form y=ax^3+bx^2+cx+d where only one root is real.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.