Search Results for ""

A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...

An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...

A Banach space is a complete vector space B with a norm ||·||. Two norms ||·||_((1)) and ||·||_((2)) are called equivalent if they give the same topology, which is equivalent ...

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...