Search Results for ""

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

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

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.

Chevalley's theorem, also known as the Chevalley-Waring theorem, states that if f is a polynomial in F[x_1,...,x_n], where F is a finite field of field characteristic p, and ...