maths.free › Combinatorics & Graph Theory › An Introduction to Combinatorics › Enumeration
Enumeration
Many basic problems in combinatorics involve counting the number of distributions of objects into cellswhere we may or may not be able to distinguish between the objects and the same for the cells.
Enumeration
Many basic problems in combinatorics involve counting the number of distributions of objects into cellswhere we may or may not be able to distinguish between the objects and the same for the cells. Also, the cells may be arranged in patterns. Here are concrete examples.
Amanda has three children: Dawn, Keesha and Seth.
Amanda has ten one dollar bills and decides to give the full amount to her children. How many ways can she do this? For example, one way she might distribute the funds is to give Dawn and Keesha four dollars each with Seth receiving the balancetwo dollars. Another way is to give the entire amount to Keesha, an option that probably won't make Dawn and Seth very happy. Note that hidden within this question is the assumption that Amanda does not distinguish the individual dollar bills, say by carefully examining their serial numbers. Instead, we intend that she need only decide the amount each of the three children is to receive.
The amounts of money distributed to the three children form a sequence which if written in non-increasing order has the form: \(a_1, a_2, a_3\) with \(a_1\ge a_2\ge a_3\) and \(a_1+a_2+a_3=10\). How many such sequences are there?
Suppose Amanda decides to give each child at least one dollar. How does this change the answers to the first two questions?
Now suppose that Amanda has ten books, in fact the top 10 books from the New York Times best-seller list, and decides to give them to her children. How many ways can she do this? Again, we note that there is a hidden assumptionthe ten books are all different.
Suppose the ten books are labeled \(B_1, B_2,\dots, B_{10}\). The sets of books given to the three children are pairwise disjoint and their union is \(\{B_1,B_2,\dots,B_{10}\}\). How many different sets of the form \(\{S_1, S_2, S_3\}\) where \(S_1\), \(S_2\) and \(S_3\) are pairwise disjoint and \(S_1\cup S_2\cup S_3=\{B_1,B_2,\dots,B_{10}\}\)?
Suppose Amanda decides to give each child at least one book. How does this change the answers to the preceding two questions?
How would we possibly answer these kinds of questions if ten was really ten thousand (OK, we're not talking about children any more!) and three was three thousand? Could you write the answer on a single page in a book?
A circular necklace with a total of six beads will be assembled using beads of three different colors. In , we show four such necklaceshowever, note that the first three are actually the same necklace. Each has three red beads, two blues and one green. On the other hand, the fourth necklace has the same number of beads of each color but it is a different necklace.
Condensed: the full section is in Keller & Trotter, Applied Combinatorics.
Now you Không máy tính nào có thể tính toán được nó, nhưng các mảnh của nó có thể tính toán được. Thử một trong những cách dưới đây, hoặc gõ theo ý bạn.
Ký hiệu được dùng ở đây
Nhấn vào bất kỳ ký hiệu nào để xem định nghĩa đầy đủ, một bức ảnh, và ý nghĩa của từng chữ cái trong nó.
Câu hỏi người ta hỏi
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
Một số phần của trang này được chuyển từ Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Được nén lại và giải thích lại ở đây; lỗi là của chúng tôi.
More in Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs