Search Results for ""

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...

Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...

If g is a continuous function g(x) in [a,b] for all x in [a,b], then g has a fixed point in [a,b]. This can be proven by supposing that g(a)>=a g(b)<=b (1) g(a)-a>=0 ...

Fredholm's theorem states that, if A is an m×n matrix, then the orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the ...

Let the opposite sides of a convex cyclic hexagon be a, a^', b, b^', c, and c^', and let the polygon diagonals e, f, and g be so chosen that a, a^', and e have no common ...

Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...