AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

Finite

From AoPSWiki

Revision as of 14:11, 7 July 2006 by JBL (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Informally, a set is said to be finite if it does not go on for ever. That is, any set whose elements could (theoretically) be named, one by one, in a finite amount of time is finite. Finite sets include the empty set, which has zero elements, and every set with a positive integer number of elements.

Formally, a set is finite if it is the empty set or it can be put into bijection with a set \{0, 1, 2, \ldots, n\} for some nonnegative integer n.

See also

Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us