TOPICS
Search

Search Results for ""


961 - 970 of 1595 for Knot polynomialSearch Results
In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...
For a given monic quartic equation f(x)=x^4+a_3x^3+a_2x^2+a_1x+a_0, (1) the resolvent cubic is the monic cubic polynomial g(x)=x^3+b_2x^2+b_1x+b_0, (2) where the coefficients ...
The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...
sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).
The curve b(u) in the ruled surface parameterization x(u,v)=b(u)+vd(u) is called the directrix (or base curve).
A conservative vector field (for which the curl del xF=0) may be assigned a scalar potential where int_CF·ds is a line integral.
If J is a simple closed curve in R^2, the closure of one of the components of R^2-J is homeomorphic with the unit 2-ball. This theorem may be proved using the Riemann mapping ...
An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...
The second Morley cubic is the triangle cubic with trilinear equation It passes through Kimberling centers X_n for n=1, 1134, 1135, 1136, and 1137.
The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...
1 ... 94|95|96|97|98|99|100 ... 160 Previous Next

...