Search Results for ""

A shuffling algorithm used in a class of random number generators.

An algorithm for computing an Egyptian fraction (Stewart 1992).

The security of a cryptosystem must not depend on keeping the cryptographic algorithm secret.

An algorithm for finding roots for quartic equations with complex roots.

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

The Heronian mean of two numbers a and b is defined as HM(a,b) = 1/3(2A+G) (1) = 1/3(a+sqrt(ab)+b), (2) where A is the arithmetic mean and G the geometric mean. It arises in ...

The analytic summation of a hypergeometric series. Powerful general techniques of hypergeometric summation include Gosper's algorithm, Sister Celine's method, Wilf-Zeilberger ...

The Stolarsky mean of two numbers a and c is defined by S_p(a,c)=[(a^p-c^p)/(p(a-c))]^(1/(p-1)) (Havil 2003, p. 121).

The identric mean is defined by I(a,b)=1/e((b^b)/(a^a))^(1/(b-a)) for a>0, b>0, and a!=b. The identric mean has been investigated intensively and many remarkable inequalities ...

The geometric mean of a sequence {a_i}_(i=1)^n is defined by G(a_1,...,a_n)=(product_(i=1)^na_i)^(1/n). (1) Thus, G(a_1,a_2) = sqrt(a_1a_2) (2) G(a_1,a_2,a_3) = ...