Search Results for ""
2661 - 2670 of 4343 for Two FormSearch Results
The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...
A curve investigated by Talbot which is the ellipse negative pedal curve with respect to the ellipse's center for ellipses with eccentricity e^2>1/2 (Lockwood 1967, p. 157). ...
In each of the ten cases with zero or unit mass, the finite part of the scalar 3-loop tetrahedral vacuum Feynman diagram reduces to four-letter "words" that represent ...
A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...
A tetramagic cube is a magic cube that remains magic when all its numbers are squared, cubed, and taken to the fourth power. Only two tetramagic cubes are known, and both ...
The term "total curvature" is used in two different ways in differential geometry. The total curvature, also called the third curvature, of a space curve with line elements ...
The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...
Let f:R×R->R be a one-parameter family of C^2 maps satisfying f(0,mu)=0 (1) [(partialf)/(partialx)]_(mu=0,x=0)=0 (2) [(partial^2f)/(partialxpartialmu)]_(0,0)>0 (3) ...
Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...
The triangular grid graph T_n is the lattice graph obtained by interpreting the order-(n+1) triangular grid as a graph, with the intersection of grid lines being the vertices ...
...


