Search Results for ""

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...

The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...

The cyclic group C_(12) is one of the two Abelian groups of the five groups total of group order 12 (the other order-12 Abelian group being finite group C2×C6). Examples ...

The cyclic group C_9 is one of the two Abelian groups of group order 9 (the other order-9 Abelian group being C_3×C_3; there are no non-Abelian groups of order 9). An example ...

The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...

The first Debye function is defined by D_n^((1))(x) = int_0^x(t^ndt)/(e^t-1) (1) = x^n[1/n-x/(2(n+1))+sum_(k=1)^(infty)(B_(2k)x^(2k))/((2k+n)(2k!))], (2) for |x|<2pi, n>=1, ...

Degen's eight-square identity is the incredible polynomial identity (1) found around 1818 by the Danish mathematician Ferdinand Degen (1766-1825). It was subsequently ...

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

A table made by subtracting adjacent entries in a sequence, then repeating the process with those numbers.