TOPICS
Search

Search Results for ""


5161 - 5170 of 9727 for Numbered Equation 2Search Results
Let (A,<=) and (B,<=) be totally ordered sets. Let C=A×B be the Cartesian product and define order as follows. For any a_1,a_2 in A and b_1,b_2 in B, 1. If a_1<a_2, then ...
Let A^' be the outermost vertex of the regular pentagon erected outward on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...
The symmetric statistic k_(r,s,...) defined such that <k_(r,s,...)>=kappa_rkappa_s..., (1) where kappa_r is a cumulant. These statistics generalize k-statistic and were ...
Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...
For a set partition of n elements, the n-character string a_1a_2...a_n in which each character gives the set block (B_0, B_1, ...) in which the corresponding element belongs ...
By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...
Suppose f(x) is a function of x that is twice differentiable at a stationary point x_0. 1. If f^('')(x_0)>0, then f has a local minimum at x_0. 2. If f^('')(x_0)<0, then f ...
The spherical curve obtained when moving along the surface of a sphere with constant speed, while maintaining a constant angular velocity with respect to a fixed diameter ...
The surface of revolution obtained by cutting a conical "wedge" with vertex at the center of a sphere out of the sphere. It is therefore a cone plus a spherical cap, and is a ...
A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...
1 ... 514|515|516|517|518|519|520 ... 973 Previous Next

...