Search Results for ""

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

For a fractal process with values y(t-Deltat) and y(t+Deltat), the correlation between these two values is given by the Brown function r=2^(2H-1)-1, also known as the ...

An extension of the secant method of root finding to higher dimensions.

A paradox arising in the use of comparative adjectives. Suppose you have exactly two brothers, both of whom are older than you are. Then the following apparently false ...

The 6-polyiamond illustrated above.

A Mandelbrot set-like fractal obtained by iterating the map z_(n+1)=z_n^3+(z_0-1)z_n-z_0.