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.

ຕົວຢ່າງ​ທີ່​ໄດ້​ເຮັດ · {1,2,3,4} union {3,4,5,6}

Set-Theory · Sets

{1,2,3,4} union {3,4,5,6}

ຂັ້ນ​ຕອນ​ຕໍ່​ຂັ້ນ​ຕອນ

  1. A = \left\{1, 2, 3, 4\right\},\quad B = \left\{3, 4, 5, 6\right\}

    The two sets.

  2. A \cup B = \left\{1, 2, 3, 4, 5, 6\right\}

    Keep everything in either set.

  3. |A| = 4,\ |B| = 4,\ |A \cup B| = 6

    Cardinalities. Note |A ∪ B| = |A| + |B| − |A ∩ B|.

ເປີດ​ເຜີຍ​ຄຳ​ຕອບ
A \cup B = \left\{1, 2, 3, 4, 5, 6\right\}

ປັດຈຸບັນ​ທ່ານ ເລືອກ​ບັນຫາ ຫຼື ພິມ ຫຼື ແຕ້ມ​ເອງ. ທຸກ​ບາດກ້າວ, ຮູບ, ຄໍາຕອບ​ຖືກ​ລົບ​ຈົນ​ກວ່າ​ເຈົ້າ​ຈະ​ຖາມ​ມັນ.

ຮັກສາ​ການ​ເຮັດວຽກ​ຂອງ​ທ່ານ​ໄວ້

ບັນຊີຟຣີ ເພີ່ມ​ຂໍ້​ມູນ​ໃສ່​ບົດຮຽນ​ທຸກ​ບົດ, ບັນທຶກ​ຂອງ​ສິ່ງທີ່​ທ່ານ​ໄດ້​ເຮັດ​ແລ້ວ, ບັນຫາ​ທີ່​ທ່ານ​ໄດ້​ແກ້​ໄຂ​ໄວ້​ໃນ​ບ່ອນ​ດຽວ ແລະ ຄູ​ສອນ​ທີ່​ທ່ານ​ສາມາດ​ຖາມ​ກ່ຽວກັບ​ໜ້າ​ນີ້. ຄະນິດສາດ​ເອງ​ແມ່ນ​ເປີດ​ໃຫ້​ທຸກ​ຄົນ, ບໍ່​ວ່າ​ຈະ​ໄດ້​ເຂົ້າ​ສູ່​ລະບົບ ຫຼື ບໍ່.

ລົງທະບຽນ ចូល

ຕົວ​ສະ​ແດງ​ທີ່​ໃຊ້​ຢູ່​ທີ່​ນີ້

ກົດ​ຕົວ​ອັກສອນ​ໃດ​ໜຶ່ງ​ເພື່ອ​ເບິ່ງ​ຄວາມ​ໝາຍ​ເຕັມ, ຮູບ ແລະ ຕົວອັກສອນ​ແຕ່ລະ​ຕົວ​ໃນ​ມັນ​ໝາຍ​ຄວາມ​ວ່າ​ແນວໃດ.

ວິທີການ: Pigeonhole principle and inclusion, exclusion

  1. The two sets.
  2. Keep everything in either set.
  3. Cardinalities. Note |A ∪ B| = |A| + |B| − |A ∩ B|.

ຄໍາຖາມທີ່ຄົນຖາມ

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.

ເພີ່ມເຕີມໃນ 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