Search Results for ""

A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

A sum is the result of an addition. For example, adding 1, 2, 3, and 4 gives the sum 10, written 1+2+3+4=10. (1) The numbers being summed are called addends, or sometimes ...

Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A number defined by b_n=b_n(0), where b_n(x) is a Bernoulli polynomial of the second kind (Roman 1984, p. 294), also called Cauchy numbers of the first kind. The first few ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

The maximum number of regions that can be created by n cuts using space division by planes, cube division by planes, cylinder cutting, etc., is given by N_(max)=1/6(n^3+5n+6) ...