Search Results for ""

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

A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

For a curve with first fundamental form ds^2=Edu^2+2Fdudv+Gdv^2, (1) the Gaussian curvature is K=(M_1-M_2)/((EG-F^2)^2), (2) where M_1 = |-1/2E_(vv)+F_(uv)-1/2G_(uu) 1/2E_u ...