Search Results for ""
3071 - 3080 of 9727 for Numbered Equation 2Search Results
Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...
The series for the inverse tangent, tan^(-1)x=x-1/3x^3+1/5x^5+.... Plugging in x=1 gives Gregory's formula 1/4pi=1-1/3+1/5-1/7+1/9-.... This series is intimately connected ...
Let A be a normed (Banach) algebra. An algebraic left A-module X is said to be a normed (Banach) left A-module if X is a normed (Banach) space and the outer multiplication is ...
A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...
A power series sum^(infty)c_kx^k will converge only for certain values of x. For instance, sum_(k=0)^(infty)x^k converges for -1<x<1. In general, there is always an interval ...
In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...
If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...
In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...
For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...
In machine learning theory, the Vapnik-Chervonenkis dimension or VC-dimension of a concept class C is the cardinality of the largest set S which can be shattered by C. If ...
...
View search results from all Wolfram sites (480708 matches)

