Search Results for ""
2051 - 2060 of 8770 for Point Line Distance 3 DimensionalSearch Results

A contravariant tensor is a tensor having specific transformation properties (cf., a covariant tensor). To examine the transformation properties of a contravariant tensor, ...
The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...
Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...
Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...
A hyperboloid is a quadratic surface which may be one- or two-sheeted. The one-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the ...
G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...
A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...
The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...
The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...
The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

...