Search Results for ""

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The theory of point sets and sequences having a uniform distribution. Uniform distribution theory is important in modeling and simulation, and especially in so-called Monte ...

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...

To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

The portion of number theory concerned with expressing an integer as a sum of integers from some given set.

Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...

A multiplicative factor (usually indexed) such as one of the constants a_i in the polynomial a_nx^n+a_(n-1)x^(n-1)+...+a_2x^2+a_1x+a_0. In this polynomial, the monomials are ...