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

Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...

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

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

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 binary logarithm log_2x is the logarithm to base 2. The notation lgx is sometimes used to denote this function in number theoretic literature. However, because Russian ...

A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

Bit rate (i.e., bits per second, abbreviated bps) is a measure of the number of data bits (digital 0s and 1s) transmitted each second in a digital communications channel. If ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...