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.
Arbejdstxrd eksempel · 5 choose 2
Trin for trin
- \binom{5}{2} = \frac{5!}{2!\,(5-2)!}
Unordered selections: n! / (k! (n−k)!).
- = \frac{120}{2 \times 6} = 10
Afslør svaret
Nu er du Vælg et problem, eller skriv eller tegne din egen. Hvert skridt, et billede, svaret skjult, indtil du spørger.
En gratis konto tilføjer noter om hver lektion, en rekord over, hvad du har afsluttet, dine løste problemer på ét sted, og en vejleder, du kan spørge om denne side. Matematik selv er åben for alle, logget på eller ej.
Tilmeld dig LoginSymboler brugt her
Tryk på ethvert symbol for den fulde definition, et billede, og hvad hvert bogstav i det betyder.
Hvordan: 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.
Spørgsmål folk spørger
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.
Mere i 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