Search Results for ""

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...

By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...

A self-avoiding walk in which steps may be to the left, right, or straight ahead after a vertical step, but only straight ahead or to the left after a horizontal step. A ...

A sequential substitution system is a substitution system in which a string is scanned from left to right for the first occurrence of the first rule pattern. If the pattern ...

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

The sign of a real number, also called sgn or signum, is -1 for a negative number (i.e., one with a minus sign "-"), 0 for the number zero, or +1 for a positive number (i.e., ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

A solution of a linear homogeneous ordinary differential equation with polynomial coefficients.

The engineering terminology for one use of Fourier transforms. By breaking up a wave pulse into its frequency spectrum f_nu=F(nu)e^(2piinut), (1) the entire signal can be ...

According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...