Search Results for ""

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...

Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

To inscribe an equilateral triangle in an ellipse, place the top polygon vertex at (0,b), then solve to find the (x,y) coordinate of the other two vertices. ...

A Pascal's triangle written in a square grid and padded with zeros, as written by Jakob Bernoulli (Smith 1984). The figurate number triangle therefore has entries a_(ij)=(i; ...

Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...

Let C_(L,M) be a Padé approximant. Then C_((L+1)/M)S_((L-1)/M)-C_(L/(M+1))S_(L/(M+1)) = C_(L/M)S_(L/M) (1) C_(L/(M+1))S_((L+1)/M)-C_((L+1)/M)S_(L/(M+1)) = ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...