Search Results for ""

The Brocard inellipse is the inconic with parameters x:y:z=1/a:1/b:1/c, (1) giving the trilinear equation ...

A Brocard line is a line from any of the vertices A_i of a triangle DeltaA_1A_2A_3 to the first Omega or second Omega^' Brocard point. Let the angle at a vertex A_i also be ...

The midpoint of the first and second Brocard points Omega and Omega^'. It has equivalent triangle center functions alpha = a(b^2+c^2) (1) alpha = sin(A+omega), (2) where ...

The first Brocard point is the interior point Omega (also denoted tau_1 or Z_1) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...

Given triangle DeltaA_1A_2A_3, let the point of intersection of A_2Omega and A_3Omega^' be B_1, where Omega and Omega^' are the Brocard points, and similarly define B_2 and ...

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

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

The inverse of the Laplace transform, given by F(t)=1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds, where gamma is a vertical contour in the complex plane chosen so ...

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.