Search Results for ""

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...

A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A simple polyhedron, also called a simplicial polyhedron, is a polyhedron that is topologically equivalent to a sphere (i.e., if it were inflated, it would produce a sphere) ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...