Search Results for ""

Brocard geometry is that part of triangle geometry concerned with the Brocard points, Brocard triangles, etc.

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.

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.

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

A sequence {nu_i} of nondecreasing positive integers is complete iff 1. nu_1=1. 2. For all k=2, 3, ..., s_(k-1)=nu_1+nu_2+...+nu_(k-1)>=nu_k-1. A corollary states that a ...

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

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.