Search Results for ""

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

The symmedial triangle DeltaK_AK_BK_C (a term coined here for the first time), is the triangle whose vertices are the intersection points of the symmedians with the reference ...

A Tauberian theorem is a theorem that deduces the convergence of an series on the basis of the properties of the function it defines and any kind of auxiliary hypothesis ...

A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...

The term two-sided ideal is used in noncommutative rings to denote a subset that is both a right ideal and a left ideal. In commutative rings, where right and left are ...

The Yff contact triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(190). It is the polar triangle of the Yff ...

A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...