Search Results for ""

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...

The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

A catastrophe which can occur for four control factors and one behavior axis. The butterfly catastrophe is the universal unfolding of the singularity f(x)=x^6 of codimension ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

The symbol intersection , used for the intersection of sets, and sometimes also for the logical connective AND instead of the symbol ^ (wedge). In fact, for any two sets A ...

Carmichael's conjecture asserts that there are an infinite number of Carmichael numbers. This was proven by Alford et al. (1994).

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...