maths.free › Combinatorics & Graph Theory › Binomial coefficients and Pascal's triangle

Binomial coefficients and Pascal's triangle

Identities, the binomial theorem, and combinatorial proofs.

C(n, k) counts k-subsets, is the coefficient in (a + b)ⁿ, and satisfies Pascal's rule C(n, k) = C(n−1, k−1) + C(n−1, k). Picture it: Pascal's triangle, each entry the sum of the two above. Think it: a combinatorial proof shows two formulas count the same set, no algebra needed.

ຕົວຢ່າງ​ທີ່​ໄດ້​ເຮັດ · expand (a + b)^6

Algebra · Expanding

Expand (a + b)^6

\left(a + b\right)^{6}

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

  1. \left(a + b\right)^{6}

    Start from the expression.

  2. a^{6} + 6 a^{5} b + 15 a^{4} b^{2} + 20 a^{3} b^{3} + 15 a^{2} b^{4} + 6 a b^{5} + b^{6}

    Distribute (multiply out) the products.

ເປີດ​ເຜີຍ​ຄຳ​ຕອບ
a^{6} + 6 a^{5} b + 15 a^{4} b^{2} + 20 a^{3} b^{3} + 15 a^{2} b^{4} + 6 a b^{5} + b^{6}

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

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

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

ລົງທະບຽນ ចូល

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

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

ວິທີການ: Binomial coefficients and Pascal's triangle

  1. Start from the expression.
  2. Distribute (multiply out) the products.

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

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 principlesPigeonhole principle and inclusion, exclusionRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs