Search Results for ""

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

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

One name for the figure used by Euclid to prove the Pythagorean theorem.

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

A number k such that nk^2 has its last digit(s) equal to k is called n-automorphic. For example, 1·5__^2=25__ (Wells 1986, pp. 58-59) and 1·6__^2=36__ (Wells 1986, p. 68), so ...

Interval arithmetic is the arithmetic of quantities that lie within specified ranges (i.e., intervals) instead of having definite known values. Interval arithmetic can be ...

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...

The point Ko of concurrence in Kosnita theorem, i.e., the point of concurrence of the lines connecting the vertices A, B, and C of a triangle DeltaABC with the circumcenters ...