Search Results for ""

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

Multivariable calculus is the branch of calculus that studies functions of more than one variable. Partial derivatives and multiple integrals are the generalizations of ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).

One name for the figure used by Euclid to prove the Pythagorean theorem. It is sometimes also known as the "windmill."

A requirement necessary for a given statement or theorem to hold. Also called a criterion.

A requirement necessary for a given statement or theorem to hold. Also called a condition.

The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.