Search Results for ""
1131 - 1140 of 1537 for triangleSearch Results
![](/common/images/search/spacer.gif)
A positive number k such that a lamina or solid body with moment of inertia about an axis I and mass m is given by I=mk^2. Pickover (1995) defines a generalization of k as a ...
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 ...
The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...
The regular nonagon is the regular polygon with nine sides and Schläfli symbol {9}. The regular nonagon cannot be constructed using the classical Greek rules of geometric ...
Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...
The vector space tensor product V tensor W of two group representations of a group G is also a representation of G. An element g of G acts on a basis element v tensor w by ...
The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...
The study of manifolds having a complete Riemannian metric. Riemannian geometry is a general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 ...
The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...
![](/common/images/search/spacer.gif)
...