Search Results for ""

The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

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

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

Binet's first formula for the log gamma function lnGamma(z), where Gamma(z) is a gamma function, is given by for R[z]>0 (Erdélyi et al. 1981, p. 21; Whittaker and Watson ...

Bipolar coordinates are a two-dimensional system of coordinates. There are two commonly defined types of bipolar coordinates, the first of which is defined by x = ...

A set of curvilinear coordinates defined by x = (asinhv)/(coshv-cosu) (1) y = (asinu)/(coshv-cosu) (2) z = z, (3) where u in [0,2pi), v in (-infty,infty), and z in ...

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...

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