Search Results for ""

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

The function Pi_(a,b)(x)=H(x-a)-H(x-b) which is equal to 1 for a<=x<=b and 0 otherwise. Here H(x) is the Heaviside step function. The special case Pi_(-1/2,1/2)(x) gives the ...

Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)

B(x,y)=[x y; +/-ty +/-x]. (1) It satisfies B(x_1,y_1)B(x_2,y_2)=B(x_1x_2+/-ty_1y_2,x_1y_2+/-y_1x_2). (2) Powers of the matrix are defined by B^n = [x y; ty x]^n (3) = [x_n ...

In a cyclic quadrilateral ABCD having perpendicular diagonals AC_|_BD, the perpendiculars to the sides through point T of intersection of the diagonals (the anticenter) ...

Let A_1, B_2, C_1, A_2, and B_1 be five points determining a conic. Then the conic is the locus of the point C_2=A_1(L·C_1A_2)·B_1(L·C_1B_2), where L is a line through the ...

A Brauer chain is an addition chain in which each member uses the previous member as an addend. A number n for which a shortest chain exists which is a Brauer chain is called ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

If, in the Gershgorin circle theorem for a given m, |a_(jj)-a_(mm)|>Lambda_j+Lambda_m for all j!=m, then exactly one eigenvalue of A lies in the disk Gamma_m.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...