Search Results for ""

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

Also known as araneidan, this curve owes its name to its spider-like shape. It is given by the polar equation r=a(sin(ntheta))/(sin[(n-1)theta]), where a>0 and n>2 is an ...

The associated Legendre differential equation is a generalization of the Legendre differential equation given by d/(dx)[(1-x^2)(dy)/(dx)]+[l(l+1)-(m^2)/(1-x^2)]y=0, (1) which ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...

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

There are several versions of the Berry paradox, the original version of which was published by Bertrand Russell and attributed to Oxford University librarian Mr. G. Berry. ...

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

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

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...