Difference between revisions of "Combinatorics"
(→Olympiad Topics) |
m |
||
Line 3: | Line 3: | ||
== Introductory combinatorics == | == Introductory combinatorics == | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== Introductory Topics == | == Introductory Topics == | ||
The following topics help shape an introduction to counting techniques: | The following topics help shape an introduction to counting techniques: | ||
+ | * [[Correspondence]] | ||
* [[Venn diagram]] | * [[Venn diagram]] | ||
* [[Combinations]] | * [[Combinations]] |
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.
Contents
[hide]Introductory combinatorics
Introductory Topics
The following topics help shape an introduction to counting techniques:
- Correspondence
- Venn diagram
- Combinations
- Permutations
- Overcounting
- Complementary counting
- Casework
- Constructive counting
- Committee forming
- Pascal's Triangle
- Combinatorial identities
- Binomial Theorem
Intermediate Topics
- Principle of Inclusion-Exclusion
- Conditional Probability
- Recursion
- Correspondence
- Generating functions
- Partitions
- Geometric probability