Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Concept

Combination

Combinatorics and Graph Theory

A combination is a selection of items from a set with distinct members such that the order of selection does not matter, unlike a permutation; formally, a k-combination of a set S is a subset of k distinct elements of S, and two combinations are identical exactly when they have the same members. If a set has n elements, the number of k-combinations is the binomial coefficient C(n, k), equal to n factorial divided by k factorial times (n minus k) factorial. A poker hand, for example, is a 5-combination of cards drawn from a 52-card deck, giving 2,598,960 possible hands. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Origin Year
850 1
Connections

Associated With

In Branch

Source Combination (Wikipedia)
Sources
1. Wikipedia: Combinatorics
Wikimedia FoundationHistory section
Quote, History section
The Indian mathematician Mahāvīra (c. 850) provided formulae for the number of permutations and combinations, and these formulas may have been familiar to Indian mathematicians as early as the 6th century CE.
View the Source
Combination (Wikipedia)
Wikimedia FoundationLead section
Quote, Lead section
a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations)
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.