Search Results for ""

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

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

Based on methods developer in collaboration with M. Leclert, Catalan (1865) computed the constant K=0.915965594177... (OEIS A006752) now known as Catalans' constant to 9 ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...