Search Results for ""

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

An algorithm for computing an Egyptian fraction.

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

An algorithm which constructs allowed mathematical statements from simple ingredients.

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

An algorithm which finds the least nonnegative value of sqrt(a (mod p)) for given a and prime p.

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.