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.
Apstrādāts piemērs · {1,2,3,4} union {3,4,5,6}
{1,2,3,4} union {3,4,5,6}
Solis pēc kārtas
- 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|.
Atbildēt uz šo jautājumu
Tagad tu Izvēlieties problēmu, vai ierakstiet vai zīmējiet savu. Katrs solis, attēls, atbilde slēpta, līdz jūs lūgt.
Bezmaksas konts pievieno piezīmes par katru nodarbību, ierakstu par to, ko esat pabeidzis, jūsu atrisinātās problēmas vienā vietā, un pasniedzēju, kuru varat jautāt par šo lapu. Pati matemātika ir pieejama ikvienam, kas ir vai nav parakstījies.
Pierakstīties PieteikšanāsŠeit izmantotie simboli
Piesitiet visiem simboliem, kas apzīmē pilnu definīciju, attēlu un ko katrs burts tajā nozīmē.
Kā lietot: Pigeonhole principle and inclusion, exclusion
- The two sets.
- Keep everything in either set.
- Cardinalities. Note |A ∪ B| = |A| + |B| − |A ∩ B|.
Jautājumi, ko cilvēki vaicā
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.
Vairāk 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