Search Results for ""
381 - 390 of 750 for Knuth Bendix Completion AlgorithmSearch Results
The hyperfactorial (Sloane and Plouffe 1995) is the function defined by H(n) = K(n+1) (1) = product_(k=1)^(n)k^k, (2) where K(n) is the K-function. The hyperfactorial is ...
Let S be a mathematical statement, then the Iverson bracket is defined by [S]={0 if S is false; 1 if S is true, (1) and corresponds to the so-called characteristic function. ...
An equation proposed by Lambert (1758) and studied by Euler in 1779. x^alpha-x^beta=(alpha-beta)vx^(alpha+beta). (1) When alpha->beta, the equation becomes lnx=vx^beta, (2) ...
The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...
A notation is a set of well-defined rules for representing quantities and operations with symbols.
A number which is simultaneously octagonal and square. Let O_n denote the nth octagonal number and S_m the mth square number, then a number which is both octagonal and square ...
The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...
A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...
A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...
There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...
...


