Discrete mathematicsLesson 3 of 5 in the course Combinatorics
Combination Counting: Binomial Coefficients, Repetition, and Grouping
5 flashcards · 5 quiz questions · 5 match pairs · 5 fill-in sentences · English
Lesson progress
0 / 5
Your progress is kept in this browser only.Sign up to save it
Summary
A combination is a way to select items when the order of selection does not matter. Recognizing when order is irrelevant helps you choose the correct counting method.
A combination is a selection of items from a set in which the order of the selected items is ignored. For example, selecting an apple and a pear gives the same combination as selecting a pear and an apple. Both selections contain the same members.
All flashcards
Quiz questions
Based on the Wikipedia article Combination, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.
More in Discrete mathematics
All Discrete mathematics lessonsDiscrete mathematicsBinary Relations: Operations, Properties, Functions, and Applications5 flashcards · 5 quiz questions · 4 gamesPlay free →Discrete mathematicsPigeonhole Principle: Counting, Collisions, and Applications5 flashcards · 5 quiz questions · 4 gamesPlay free →Discrete mathematicsDe Morgan's Laws in Logic, Set Theory, and Boolean Algebra5 flashcards · 5 quiz questions · 4 gamesPlay free →Discrete mathematicsEulerian Routes: Criteria, Construction, and Extensions5 flashcards · 5 quiz questions · 4 gamesPlay free →Discrete mathematicsNumber Theory: Integer Structure, Methods, and Applications5 flashcards · 5 quiz questions · 4 gamesPlay free →Discrete mathematicsBinomial Coefficients: Expansion, Counting, and Identities5 flashcards · 5 quiz questions · 4 gamesPlay free →