Binomial coefficient: Difference between revisions
Jump to navigation
Jump to search
imported>Karsten Meyer (New page: The '''binomial coefficient''' is part of the Combinatoric. The ''binomial coeffizient'' represent the the choose of ''k'' elements out of ''n'' elements. The ''binomial coeffizient'' ...) |
imported>Karsten Meyer mNo edit summary |
||
Line 16: | Line 16: | ||
== Usage == | == Usage == | ||
The ''binomial coeffizient'' is used in the Lottery. For example the german ''Lotto'' have a System, where you can choose 6 numbers from the numbers 1 to 49. The ''binomial coeffizient'' <math>{49 \choose 6} is 13.983.816, so the probability to choose the correct six numbers is 1 to 13.983.816 <math>{49 \choose 6} = 13.983.816 | The ''binomial coeffizient'' is used in the Lottery. For example the german ''Lotto'' have a System, where you can choose 6 numbers from the numbers 1 to 49. The ''binomial coeffizient'' <math>{49 \choose 6}</math> is 13.983.816, so the probability to choose the correct six numbers is 1 to 13.983.816 <math>{49 \choose 6} = 13.983.816</math> | ||
== ''binomial coefficients'' and ''prime numbers'' == | == ''binomial coefficients'' and ''prime numbers'' == | ||
Iff ''p'' is a [[prime number]] than p divides <math>{p \choose k}</math> for every <math>1<k<p\ </math>. The converse is true. | Iff ''p'' is a [[prime number]] than p divides <math>{p \choose k}</math> for every <math>1<k<p\ </math>. The converse is true. |
Revision as of 07:22, 29 May 2008
The binomial coefficient is part of the Combinatoric. The binomial coeffizient represent the the choose of k elements out of n elements. The binomial coeffizient is written as
Definition
- Example:
- for
- for
- for
- if or
- Examples:
- : =
- :
Usage
The binomial coeffizient is used in the Lottery. For example the german Lotto have a System, where you can choose 6 numbers from the numbers 1 to 49. The binomial coeffizient is 13.983.816, so the probability to choose the correct six numbers is 1 to 13.983.816
binomial coefficients and prime numbers
Iff p is a prime number than p divides for every . The converse is true.