Search Results for ""

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The Borromean rings, also called the Borromean links (Livingston 1993, p. 10) are three mutually interlocked rings (left figure), named after the Italian Renaissance family ...

Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...

Define the first Brocard point as the interior point Omega of a triangle for which the angles ∠OmegaAB, ∠OmegaBC, and ∠OmegaCA are equal to an angle omega. Similarly, define ...

The Brocard axis is the line KO passing through the symmedian point K and circumcenter O of a triangle, where the segment OK is the Brocard diameter (Kimberling 1998, p. ...

The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...