Search Results for ""

The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...

A construction for the rhombic dodecahedron.

In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...

Baxter's four-coloring constant for a triangular lattice is given by C^2 = product_(j=1)^(infty)((3j-1)^2)/((3j-2)(3j)) (1) = 3/(4pi^2)Gamma^3(1/3) (2) = 1.46099848... (3) ...

Let A and B_j be sets. Conditional probability requires that P(A intersection B_j)=P(A)P(B_j|A), (1) where intersection denotes intersection ("and"), and also that P(A ...

Bayesian analysis is a statistical procedure which endeavors to estimate parameters of an underlying distribution based on the observed distribution. Begin with a "prior ...

A shuffling algorithm used in a class of random number generators.

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...

A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...

A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...