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.
Exemplu lucrat · 5 choose 2
Pas cu pas
- \binom{5}{2} = \frac{5!}{2!\,(5-2)!}
Unordered selections: n! / (k! (n−k)!).
- = \frac{120}{2 \times 6} = 10
Revelează răspunsul
Acum tu Alege o problemă, sau tasta sau deseneaza-ti propria. Fiecare pas, o imagine, raspunsul ascuns pana cand intrebi.
Un cont gratuit adaugă notițe despre fiecare lecție, un record de ceea ce ați terminat, problemele rezolvate într-un singur loc, și un tutor puteți întreba despre această pagină. Matemática în sine este deschisă tuturor, semnat sau nu.
Înregistrează LoginSimbole utilizate aici
Atinge orice simbol pentru definiţia completă, o imagine şi ce înseamnă fiecare literă.
Cum să: The counting principles
- Decide whether order matters (permutation) or not (combination).
- Decide whether repetition is allowed.
- Break the count into independent stages (multiply) or exclusive cases (add).
- Sanity-check with a tiny case you can list by hand.
Întrebări pe care oamenii le întreabă
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.
Mai multe în 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