Search Results for ""

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

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

An extended form of Bürmann's theorem. Let f(z) be a function of z analytic in a ring-shaped region A, bounded by another curve C and an inner curve c. Let theta(z) be a ...

A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...

Trigonometric functions of npi/13 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 13 is not a ...

The trilogarithm Li_3(z), sometimes also denoted L_3, is special case of the polylogarithm Li_n(z) for n=3. Note that the notation Li_3(x) for the trilogarithm is ...

A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...

A transformation of a polynomial equation f(x)=0 which is of the form y=g(x)/h(x) where g and h are polynomials and h(x) does not vanish at a root of f(x)=0. The cubic ...