Search Results for ""

A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

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.

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

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).

A highly structured geometric object used to study groups which act upon them.

A C^*-algebra is a Banach algebra with an antiautomorphic involution * which satisfies (x^*)^* = x (1) x^*y^* = (yx)^* (2) x^*+y^* = (x+y)^* (3) (cx)^* = c^_x^*, (4) where ...

The field of complex numbers, denoted C.

Cahen's constant is defined as C = sum_(k=0)^(infty)((-1)^k)/(a_k-1) (1) = 0.64341054628... (2) (OEIS A118227), where a_k is the kth term of Sylvester's sequence.