Binomial coefficient: Difference between revisions
imported>Alexander Wiebel |
mNo edit summary |
||
(3 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k'' elements out of ''n'' elements. The binomial | The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k'' elements out of ''n'' labelled elements (with the order of the ''k'' elements being irrelevant): that is, the number of [[subset]]s of size ''k'' in a set of size ''n''. The binomial coefficients are written as <math>\tbinom{n}{k}</math>; they are named for their role in the expansion of the [[Binomial theorem|binomial]] expression (''x''+''y'')<sup>''n''</sup>. | ||
== Definition == | == Definition == | ||
:<math>{n \choose k} = \frac{n\cdot (n-1)\cdot (n-2) \cdots (n-k+1)}{1\cdot 2\cdot 3\cdots k} = \frac{n!}{k!\cdot (n-k)!}\quad\mathrm{for}\ n \ge k \ge 0</math> | :<math>{n \choose k} = \frac{n\cdot (n-1)\cdot (n-2) \cdots (n-k+1)}{1\cdot 2\cdot 3\cdots k} = \frac{n!}{k!\cdot (n-k)!}\quad\mathrm{for}\ n \ge k \ge 0</math> | ||
=== Example === | === Example === | ||
:<math>{8 \choose 3} = \frac{8\cdot 7\cdot 6}{1\cdot 2\cdot 3} = 56</math> | :<math>{8 \choose 3} = \frac{8\cdot 7\cdot 6}{1\cdot 2\cdot 3} = 56</math> | ||
== | |||
== Formulae involving binomial coefficients == | |||
Specifying a [[subset]] of size ''k'' is equivalent to specifying its [[complement]], a subset of size ''n''-''k'' and vice versa. Hence | |||
:<math>{n \choose k} = {n \choose n-k}</math> | :<math>{n \choose k} = {n \choose n-k}</math> | ||
There is just one way to choose ''n'' elements out of ''n'' ("all of them") and correspondingly just one way to choose zero element ("none of them"). | |||
:<math>{n \choose n} = {n \choose 0} = 1\quad\mathrm{for}\ n \ge 0</math> | :<math>{n \choose n} = {n \choose 0} = 1\quad\mathrm{for}\ n \ge 0</math> | ||
The number of [[singleton]]s (single-element sets) is ''n''. | |||
:<math>{n \choose 1} = n\quad\mathrm{for}\ n \ge 1</math> | :<math>{n \choose 1} = n\quad\mathrm{for}\ n \ge 1</math> | ||
The subset of size ''k'' out of ''n'' things may be split into those which do not contain the element ''n'', which correspond to subset of ''n''-1 of size ''k'', and those which do contain the element ''n''. The latter are uniquely specified by the remaining ''k''-1 element which are drawn from the other ''n''-1. | |||
:<math>{n \choose k} = {n-1 \choose k} + {n-1 \choose k-1}</math> | :<math>{n \choose k} = {n-1 \choose k} + {n-1 \choose k-1}</math> | ||
There are no subsets of negative size or of size greater than ''n''. | |||
:<math>{n \choose k} = 0\quad\mathrm{if}\ k > n\ \mathrm{or}\ k\ < 0</math> | :<math>{n \choose k} = 0\quad\mathrm{if}\ k > n\ \mathrm{or}\ k\ < 0</math> | ||
=== Examples === | === Examples === | ||
:<math>k > n\ \mathrm{:}\ {n \choose k} = \frac{n\cdot n-1\cdot n-2 \cdots n-n \cdots n-k+1}{1\cdot 2\cdot 3\cdots k}</math> = <math>{n \choose k} = \frac{0}{1\cdot 2\cdot 3\cdots k} = 0</math> | :<math>k > n\ \mathrm{:}\ {n \choose k} = \frac{n\cdot (n-1)\cdot (n-2) \cdots (n-n) \cdots (n-k+1)}{1\cdot 2\cdot 3\cdots k}</math> = <math>{n \choose k} = \frac{0}{1\cdot 2\cdot 3\cdots k} = 0</math> | ||
:<math>k\ < 0\ \mathrm{:}\ {n \choose n-k} = {n \choose k}</math> | :<math>k\ < 0\ \mathrm{:}\ {n \choose n-k} = {n \choose k}</math> | ||
Line 25: | Line 32: | ||
== Usage == | == Usage == | ||
The binomial coefficient can be used to describe the mathematics of lottery games. For example the | The binomial coefficient can be used to describe the mathematics of lottery games. For example the German ''Lotto'' has a system, where you can choose 6 numbers from the numbers 1 to 49. The binomial coefficient <math>\tbinom{49}{6}</math> is 13,983,816, so the probability to choose the correct six numbers is <math>\frac{1}{13,983,816}=\frac{1}{{49\choose 6}}</math>. | ||
== | == Binomial coefficients and prime numbers == | ||
If ''p'' is a [[prime number]] then ''p'' divides <math>\tbinom{p}{k}</math> for every <math>1<k<p\ </math>. The converse is also true.[[Category:Suggestion Bot Tag]] |
Latest revision as of 16:00, 18 July 2024
The binomial coefficient is a part of combinatorics. The binomial coefficient represent the number of possible choices of k elements out of n labelled elements (with the order of the k elements being irrelevant): that is, the number of subsets of size k in a set of size n. The binomial coefficients are written as ; they are named for their role in the expansion of the binomial expression (x+y)n.
Definition
Example
Formulae involving binomial coefficients
Specifying a subset of size k is equivalent to specifying its complement, a subset of size n-k and vice versa. Hence
There is just one way to choose n elements out of n ("all of them") and correspondingly just one way to choose zero element ("none of them").
The number of singletons (single-element sets) is n.
The subset of size k out of n things may be split into those which do not contain the element n, which correspond to subset of n-1 of size k, and those which do contain the element n. The latter are uniquely specified by the remaining k-1 element which are drawn from the other n-1.
There are no subsets of negative size or of size greater than n.
Examples
- =
Usage
The binomial coefficient can be used to describe the mathematics of lottery games. For example the German Lotto has a system, where you can choose 6 numbers from the numbers 1 to 49. The binomial coefficient is 13,983,816, so the probability to choose the correct six numbers is .
Binomial coefficients and prime numbers
If p is a prime number then p divides for every . The converse is also true.