TOPICS
Search

Search Results for ""


3321 - 3330 of 3842 for Betrothed numbersSearch Results
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...
The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...
Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...
A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...
A tiling consisting of a rhombus such that 17 rhombuses fit around a point and a second tile in the shape of six rhombuses stuck together. These two tiles can fill the plane ...
A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...
Let l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...
The Cartesian product of a countable infinity of copies of the interval [0,1]. It can be denoted [0,1]^(aleph_0) or [0,1]^omega, where aleph_0 and omega are the first ...
A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...
1 ... 330|331|332|333|334|335|336 ... 385 Previous Next

...