Search Results for ""
3591 - 3600 of 13134 for Graph TheorySearch Results
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 ...
Letting Lk be the linking number of the two components of a ribbon, Tw be the twist, and Wr be the writhe, then Lk(K)=Tw(K)+Wr(K). (Adams 1994, p. 187).
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 ...
For any system that seeks to minimize a function, only seven different local forms of catastrophe "typically" occur for four or fewer variables: 1. Fold catastrophe, 2. Cusp ...
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 ...
There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...
Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.
...
View search results from all Wolfram sites (33872 matches)

