Search Results for ""

A root-finding algorithm used in LU decomposition. It solves the N^2 equations i<j l_(i1)u_(1j)+l_(i2)u_(2j)+...+l_(ii)u_(ij)=a_(ij)i=j ...

A group of sociable numbers of order 3.

The 6-polyiamond illustrated above.

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

A plane quartic curve also called the cross curve or policeman on point duty curve (Cundy and Rollett 1989). It is given by the implicit equation x^2y^2-b^2x^2-a^2y^2=0, (1) ...

Two bits or half a nibble. Since a crumb encodes values from 0 to 2^2-1=3, it can conveniently be represented using single quaternary digit. However, the term "crumb" is ...

A crunode, also known as an ordinary double point, of a plane curve is point where a curve intersects itself so that two branches of the curve have distinct tangent lines. ...

The science of breaking codes, which is one part of cryptology.

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

A cryptographic hash function is most commonly one of the following: a one-way hash function, a collision-free hash function, a trapdoor one-way hash function, or a function ...