Search Results for ""

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

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 ...

In the above figure, let DeltaABC be a right triangle, arcs AP and AQ be segments of circles centered at C and B respectively, and define a = BC (1) b = CA=CP (2) c = BA=BQ. ...

Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...

Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...

A triangle cubic is a curve that can be expressed in trilinear coordinates such that the highest degree term in the trilinears alpha, beta, and gamma is of order three. Wells ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

The triangle function is the function Lambda(x) = {0 |x|>=1; 1-|x| |x|<1 (1) = Pi(x)*Pi(x) (2) = Pi(x)*H(x+1/2)-Pi(x)*H(x-1/2), (3) where Pi(x) is the rectangle function, ...

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, ...