Search Results for ""

A Wieferich prime is a prime p which is a solution to the congruence equation 2^(p-1)=1 (mod p^2). (1) Note the similarity of this expression to the special case of Fermat's ...

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...

Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...

The simple continued fraction representations for Catalan's constant K is [0, 1, 10, 1, 8, 1, 88, 4, 1, 1, ...] (OEIS A014538). A plot of the first 256 terms of the continued ...

A category consists of three things: a collection of objects, for each pair of objects a collection of morphisms (sometimes call "arrows") from one to another, and a binary ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...