Search Results for ""

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...

The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.

For a real number x, the mantissa is defined as the positive fractional part x-|_x_|=frac(x), where |_x_| denotes the floor function. For example, for x=3.14159, the mantissa ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...