Search Results for ""

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" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

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

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

The Borwein integrals are the class of definite integrals defined by I_n=1/piint_0^inftyx^(-(n+1)/2)product_(k=1,3,...)^nsin(x/k)dx for odd n. The integrals are curious ...

The box fractal is a fractal also called the anticross-stitch curve which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 0 ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

The first Brocard point is the interior point Omega (also denoted tau_1 or Z_1) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...

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