Search Results for ""
511 - 520 of 594 for intSearch Results
"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...
The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...
Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...
A sufficient condition on the Lindeberg-Feller central limit theorem. Given random variates X_1, X_2, ..., let <X_i>=0, the variance sigma_i^2 of X_i be finite, and variance ...
Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...
Let K be a field of arbitrary characteristic. Let v:K->R union {infty} be defined by the following properties: 1. v(x)=infty<=>x=0, 2. v(xy)=v(x)+v(y) forall x,y in K, and 3. ...
By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...
Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...
The circle passing through the isodynamic points S and S^' and the triangle centroid G of a triangle DeltaA_1A_2A_3 (Kimberling 1998, pp. 227-228). The Parry circle has ...
Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...
...
View search results from all Wolfram sites (22353 matches)

