Difference between revisions of "Combinatorics/Introduction"
(→See also: remove dead link) |
(→Introductory topics in combinatorics) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 6: | Line 6: | ||
* [[Correspondence]] | * [[Correspondence]] | ||
* [[Venn diagram]] | * [[Venn diagram]] | ||
| + | * [[Permutations]] | ||
* [[Combinations]] | * [[Combinations]] | ||
| − | |||
* [[Overcounting]] | * [[Overcounting]] | ||
* [[Complementary counting]] | * [[Complementary counting]] | ||
| Line 15: | Line 15: | ||
* [[Pascal's Triangle]] | * [[Pascal's Triangle]] | ||
* [[Combinatorial identities]] | * [[Combinatorial identities]] | ||
| + | * [[Distinguishability]] | ||
== Introductory combinatorics resources == | == Introductory combinatorics resources == | ||
Revision as of 06:14, 15 May 2012
Combinatorics is the study of counting discrete quantities.
Contents
Introductory topics in combinatorics
The following topics provide a good study in introductory combinatorics.
- Correspondence
- Venn diagram
- Permutations
- Combinations
- Overcounting
- Complementary counting
- Casework
- Constructive counting
- Committee forming
- Pascal's Triangle
- Combinatorial identities
- Distinguishability
Introductory combinatorics resources
Books
- the Art of Problem Solving Introduction to Counting and Probability by David Patrick (details)
