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

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

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

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

The Behrmann cylindrical equal-area projection is a cylindrical equal-area projection with a standard parallel of phi_s=30 degrees.

The bei_nu(z) function is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...

The bellows conjecture asserts that all flexible polyhedra keep a constant volume as they are flexed (Cromwell 1997). The conjecture was apparently proposed by Dennis ...

A Belphegor number (also known as a Beelphegor number or a beastly palindromic prime) is a palindromic number of the form 1(0...)666(0...)1. Numbers of this form are named ...

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...