Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Combinatorics"
Line 2: Line 2:
  
  
−
== Introductory combinatorics ==
+
=== Introductory combinatorics ===
−
The two most basic and fundamental ideas are that of [[permutations]] and [[combinations]].
 
−
In essentials, the permutation is the number of ways to create a subset of a larger set if order matters (i.e. A, B, C is different from A, C, B).
 
−
Similarly, the combination is the number of ways to create a subset of a larger set if order does NOT matter (i.e. A, B, C is the same as A, C, B).
 
  
−
 
+
The two most basic and fundamental ideas are that of [[permutations]] and [[combinations]]. In essence, the permutation is the number of ways to create a subset of a larger set if order matters (i.e. A, B, C is different from A, C, B). Similarly, the combination is the number of ways to create a subset of a larger set if order does NOT matter (i.e. A, B, C is the same as A, C, B).
−
'''Factorials'''
 
−
<math>n!=n(n-1)(n-2)\cdots(2)(1)</math>
 
−
 
 
−
A '''permutation''' of a set of r objects is any rearrangement of the r objects ''with regard to order''.  To find how many ways we can do this, note that for the first of the r elements, we have n different objects we can choose from.  For the second element there are (n-1) objects we can choose, (n-2) for the third and so on. In general, the number of ways to permute r objects from a set of n is given by
 
−
<math>P(n,r)=n(n-1)(n-2)\cdots(n-r+1)=\frac{n!}{(n-r)!}</math>  (by the [[Fundamental Counting Principle]]
 
−
 
 
−
The number of '''combinations''' of r objects from a set of n total is the number of ways the r objects can be arranged ''with regard to order.''
 
−
Consider the set of letters A, B, and C.  There are P(3,3)=6 different permutations of those letters. Since order doesn't matter with combinations, there is only one combination of those three.  In general, since for every permutation of r objects from n elements P(n,r), there are r! more ways to permute them than to choose them.  We have r!C(n,r)=P(n,r)or <math>\binom{n}{r}=\frac{n!}{r!(n-r)!}</math>
 
  
 
== Intermediate combinatorics ==
 
== Intermediate combinatorics ==
 
An important result of counting techniques is the formulation of the [[Principle of Inclusion-Exclusion]] (PIE).
 
An important result of counting techniques is the formulation of the [[Principle of Inclusion-Exclusion]] (PIE).

Revision as of 13:59, 18 June 2006

Combinatorics is the study of counting.


Introductory combinatorics

The two most basic and fundamental ideas are that of permutations and combinations. In essence, the permutation is the number of ways to create a subset of a larger set if order matters (i.e. A, B, C is different from A, C, B). Similarly, the combination is the number of ways to create a subset of a larger set if order does NOT matter (i.e. A, B, C is the same as A, C, B).

Intermediate combinatorics

An important result of counting techniques is the formulation of the Principle of Inclusion-Exclusion (PIE).

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Combinatorics&oldid=2692"