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

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

Analytic representations the symmetric triangle wave with period 2 and varying between -1 and 1 include f(x) = 2/pisin^(-1)[sin(pix)] (1) = 1-2|1-[2(1/2x+1/4 (mod 1))]| (2) = ...

Suppose that A and B are two algebras and M is a unital A-B-bimodule. Then [A M; 0 B]={[a m; 0 b]:a in A,m in M,b in B} with the usual 2×2 matrix-like addition and ...

The triangular distribution is a continuous distribution defined on the range x in [a,b] with probability density function P(x)={(2(x-a))/((b-a)(c-a)) for a<=x<=c; ...

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