maths.free › Combinatorics & Graph Theory › The counting principles

The counting principles

Product rule, sum rule, permutations, combinations, and when each applies.

Independent choices multiply; exclusive alternatives add. Ordered selections are permutations, unordered are combinations. Picture it: a tree diagram, each level a choice, each leaf an outcome. Think it: every counting formula is a bijection with something easy to count.

Contoh soal · 5 choose 2

Discrete-Math · Counting

5 choose 2

5,\ 2

Langkah demi langkah

  1. \binom{5}{2} = \frac{5!}{2!\,(5-2)!}

    Unordered selections: n! / (k! (n−k)!).

  2. = \frac{120}{2 \times 6} = 10

Tampilkan jawaban
\binom{5}{2} = 10

Sekarang Anda Pilih soal, atau ketik atau gambar soal Anda sendiri. Setiap langkah, sebuah gambar, jawabannya tersembunyi sampai Anda memintanya.

Simpan pekerjaan Anda sendiri

Sebuah akun gratis menambahkan catatan pada setiap pelajaran, catatan apa yang telah Anda selesaikan, masalah yang Anda selesaikan di satu tempat, dan tutor yang dapat Anda tanyakan tentang halaman ini. matematika itu sendiri terbuka untuk semua orang, ditandatangani atau tidak.

Daftar Masuk

Simbol yang digunakan di sini

Sentuh simbol apapun untuk definisi lengkap, gambar, dan apa setiap huruf di dalamnya berarti.

Bagaimana: The counting principles

  1. Decide whether order matters (permutation) or not (combination).
  2. Decide whether repetition is allowed.
  3. Break the count into independent stages (multiply) or exclusive cases (add).
  4. Sanity-check with a tiny case you can list by hand.

Pertanyaan yang sering diajukan

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.

Lainnya di Combinatorics & Graph Theory

Pigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs