Search Results for ""

A prime factorization algorithm.

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

A method of constructing uniform polyhedra.

An equilibrium minimal surface for a crystal or drop which has the least anisotropic surface free energy for a given volume. It is the anisotropic analog of a sphere. In the ...

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

A braid in which strands are intertwined in the center and are free in "handles" on either side of the diagram.

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.

A technique is a specific method of performing an operation. The terms algorithm, method, and procedure are also used interchangeably.

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...