maths.free › Combinatorics & Graph Theory › Pigeonhole principle and inclusion, exclusion
Pigeonhole principle and inclusion, exclusion
Two counting ideas that prove things without listing anything.
Pigeonhole: more pigeons than holes means some hole holds two. Inclusion, exclusion: |A ∪ B| = |A| + |B| − |A ∩ B|, and the alternating sum continues for more sets. Picture it: a Venn diagram; the overlap is what you counted twice. Think it: inclusion, exclusion is the Möbius function of the subset lattice.
Gumagana halimbawa · {1,2,3,4} union {3,4,5,6}
{1,2,3,4} union {3,4,5,6}
Hakbang-hakbang
- A = \left\{1, 2, 3, 4\right\},\quad B = \left\{3, 4, 5, 6\right\}
The two sets.
- A \cup B = \left\{1, 2, 3, 4, 5, 6\right\}
Keep everything in either set.
- |A| = 4,\ |B| = 4,\ |A \cup B| = 6
Cardinalities. Note |A ∪ B| = |A| + |B| − |A ∩ B|.
Ipahayag ang sagot
Ngayon ikaw Pumili ng isang problema, o i-type o gumuhit ng iyong sarili. Sa bawat hakbang, isang larawan, ang sagot na nakatago hanggang sa hilingin mo.
Ang isang libreng account ay nagdaragdag ng mga tala sa bawat aralin, isang tala ng kung ano ang iyong natapos, ang iyong mga nalulutas na problema sa isang lugar, at isang guro na maaari mong tanungin tungkol sa pahinang ito. Ang matematika mismo ay bukas sa lahat, naka-sign in o hindi.
Mag-sign Up Mag-loginMga simbolong ginagamit dito
I-tap ang anumang simbolo para sa buong kahulugan, isang larawan, at kung ano ang ibig sabihin ng bawat titik sa ito.
Paano: Pigeonhole principle and inclusion, exclusion
- The two sets.
- Keep everything in either set.
- Cardinalities. Note |A ∪ B| = |A| + |B| − |A ∩ B|.
Mga katanungan na tanong ng mga tao
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.
Higit pa sa Combinatorics & Graph Theory
The counting principlesBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs