Search Results for ""

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

An (m+1)-dimensional subspace W of an (n+1)-dimensional vector space V can be specified by an (m+1)×(n+1) matrix whose rows are the coordinates of a basis of W. The set of ...

The stomachion is a 14-piece dissection puzzle similar to tangrams. It is described in fragmentary manuscripts attributed to Archimedes as noted by Magnus Ausonius (310-395 ...

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

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

There are several statistical quantities called means, e.g., harmonic mean, geometric mean, arithmetic-geometric mean, and root-mean-square. When applied to two elements a ...

Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...

A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...

Bourque and Ligh (1992) conjectured that the least common multiple matrix on a GCD-closed set S is nonsingular. This conjecture was shown to be false by Haukkanen et al. ...