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.
ਕੰਮ ਉਦਾਹਰਨ · 5 choose 2
ਕਦਮ ਦਰ ਕਦਮ
- \binom{5}{2} = \frac{5!}{2!\,(5-2)!}
Unordered selections: n! / (k! (n−k)!).
- = \frac{120}{2 \times 6} = 10
ਜਵਾਬ ਦਿਓ
ਹੁਣ ਤੁਸੀਂ ਇੱਕ ਸਮੱਸਿਆ ਚੁਣੋ, ਜਾਂ ਆਪਣਾ ਆਪ ਲਿਖੋ ਜਾਂ ਖਿੱਚੋ। ਹਰ ਕਦਮ, ਇੱਕ ਤਸਵੀਰ, ਜਵਾਬ ਜਦੋਂ ਤੱਕ ਤੁਸੀਂ ਪੁੱਛਦੇ ਹੋ, ਲੁਕਿਆ ਰਹਿੰਦਾ ਹੈ।
ਇੱਥੇ ਵਰਤੇ ਨਿਸ਼ਾਨ
ਕਿਸੇ ਵੀ ਨਿਸ਼ਾਨ ਨੂੰ ਦਬਾਉ, ਜਿਸ ਵਿੱਚ ਪੂਰੀ ਪਰਿਭਾਸ਼ਾ, ਇੱਕ ਤਸਵੀਰ ਅਤੇ ਹਰ ਅੱਖਰ ਦਾ ਅਰਥ ਹੈ ।
ਕਿਵੇਂ: 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.
ਲੋਕ ਪੁੱਛਦੇ ਹਨ
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
Pigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs