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
ಅಡಿಯಿಡು (step)
- \binom{5}{2} = \frac{5!}{2!\,(5-2)!}
Unordered selections: n! / (k! (n−k)!).
- = \frac{120}{2 \times 6} = 10
ಉತ್ತರವನ್ನು ತಿಳಿಸಿ
ಈಗ ನೀವು ಪ್ರತಿಯೊಂದು ಹೆಜ್ಜೆಯಲ್ಲಿ, ಒಂದು ಚಿತ್ರವನ್ನು ನೀವು ಕೇಳುವ ತನಕ ಅಡಗಿಸಿಟ್ಟಿಡಿರಿ.
A free account adds notes on every lesson, a record of what you have finished, your solved problems in one place, and a tutor you can ask about this page. The maths itself is open to everyone, signed in or not.
ಮೇಲೆ ಗುರುತು ಹಾಕು ಪ್ರವೇಶ (ಲಾಗಿನ್)ಇಲ್ಲಿ ಬಳಸಲಾದ ಸಂಕೇತಗಳು
ಈ ವಚನದಲ್ಲಿ ಬಳಸಲಾಗಿರುವ ಗ್ರೀಕ್ ಪದವು, ಚಿತ್ರ ಮತ್ತು ಚಿತ್ರಗಳನ್ನು ನೀವು ಸುಲಭವಾಗಿ ಅರ್ಥಮಾಡಿಕೊಳ್ಳಲು ಸಹಾಯ ಮಾಡುತ್ತದೆ.
ಹೇಗೆ: 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