Difference between revisions of "Combinatorics"

Revision as of 10:56, 1 July 2006

Combinatorics is the study of counting. Different kinds of counting problems can be approached by a variety of techniques.

The following topics help shape an introduction to counting techniques:

@@ Line 3: / Line 3: @@
 == Introductory combinatorics ==
-=== Lists -- the beginning ===
-Consider the task of counting the number of integers between 14 and 103 inclusive.  We could simply list those [[integers]] and count them.  However, we can renumber those integers so that they correspond to the [[counting numbers]] (positive integers), starting with 1.  In this [[correspondence]], 14 corresponds to 1 (for the 1st integer in the list), 15 with 2, 16 with 3, etc.  The relationship between the members of each pair is that the second is 13 less than the first.  So, we know that 103 corresponds to the 103 - 13 = 90th integer in the list.  Thus, the list is 90 integers long.
-Note that <math>13 = 14 - 1</math>, or 1 less than the first integer in the list.  If we start our list with <math>n</math> and end with <math>m</math> (i.e. m and n inclusive), the number of integers in the list is
-<math>\displaystyle m - (n -1) = m - n + 1.</math>
 == Introductory Topics ==
 The following topics help shape an introduction to counting techniques:
+* [[Correspondence]]
 * [[Venn diagram]]
 * [[Combinations]]