AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
Personal tools

Countable

From AoPSWiki

This article is a stub. Help us out by expanding it.


A set S is said to be countable if there is an injection f:S\to\mathbb{Z}. Informally, a set is countable if it has at most as many elements as does the set of integers. The countable sets can be divided between those which are finite and those which are countably infinite.

The name "countable" arises because the countably infinite sets are exactly those which can be put into bijection with the natural numbers, i.e. those whose elements can be "counted."

Countably infinite sets include the integers, the positive integers and the rational numbers.

Uncountable sets include the real numbers and the complex numbers.

Properties

  • Any finite set is countable.
Stay informed about new Art of Problem Solving developments.
Click here to join our mailing lists.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us