Difference between revisions of "Manuals/calci/BINOMIAL"
Jump to navigation
Jump to search
(Created page with "<div id="6SpaceContent" class="zcontent" align="left"> '''RANDOMNUMBERGENERATION'''(Number, RandomNumber, Distribution, NewTableFlag, ProbabilityValue,Trials) where, ...") |
|||
Line 1: | Line 1: | ||
− | <div | + | <div style="font-size:30px">'''BINOMIAL(n,k)'''</div><br/> |
+ | *<math>n</math> is the number of items. | ||
+ | *<math>k </math> is the number of selection. | ||
− | |||
− | where, | + | ==Description== |
+ | *This function gives the coefficent of the binomial distribution. | ||
+ | *Binomial coefficient is the set of positive integer which equals the number of combinations of k items that can be selected from a set of n items. | ||
+ | *The coefficients satisfy the Pascals recurrence. | ||
+ | *The binomial coefficents are denoted by <math>\binom{n}{k}</math> and it is read by n choose k. | ||
+ | *It is the coefficient of the <math>x^k</math> term in the polynomial expansion of the binomial thorem <math>(1 + x)^n</math>. | ||
+ | *The coefficient is occur in the formula of binomial thorem: | ||
+ | <math>(x+y)^n=\sum _{k=0}^n \binom{n}{k} x^{n-k} y^k</math> ,where <math> k\le n</math>. | ||
+ | *To find the coefficient of the binomial ,we can use several methods. | ||
+ | 1. Recursive formula | ||
+ | 2. Multiplicative formula | ||
+ | 3. Factorial formula. | ||
+ | *1.Recursive Formula: | ||
+ | <math>\binom{n}{k}= \binom{n-1}{k-1} +\binom{n-1}{k}</math> for <math>n,k>0</math> and <math>1\le k\le n-1</math>. | ||
+ | *2. Multiplicative formula: | ||
+ | <math>\binom{n}{k}= \prod_{i=1}^k \frac{n+1-i}{i}</math> | ||
+ | *3.Factorial formula: | ||
+ | <math>\binom{n}{k}= \frac{n!}{k!(n-k)!}</math> where <math>k\le n</math>,and which is zero when <math>k>n</math>. | ||
+ | *Also for the initial values <math> \binom{n}{0}=\binom{n}{n}=1 </math> for <math>n\ge 0</math>. | ||
+ | *Most compact formula for the coefficient of the binomial value is Factorial formula. | ||
+ | *Factorial formula is symmetric of the combination formula. | ||
− | + | ==Examples== | |
+ | #=BINOMIAL(10,3)= 120 | ||
+ | #=BINOMIAL(20,7)= 77520 | ||
+ | #=BINOMIAL(15,0)= 1 | ||
+ | #=BINOMIAL(12,12)=1 | ||
+ | #=BINOMIAL(1,-1) = 0 | ||
− | + | ==See Also== | |
+ | *[[Manuals/calci/BINOMDIST | BINOMDIST ]] | ||
+ | *[[Manuals/calci/BINOMIALDISTRIBUTED | BINOMIALDISTRIBUTED ]] | ||
− | + | ==References== | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |
Revision as of 02:21, 24 March 2014
BINOMIAL(n,k)
- is the number of items.
- is the number of selection.
Description
- This function gives the coefficent of the binomial distribution.
- Binomial coefficient is the set of positive integer which equals the number of combinations of k items that can be selected from a set of n items.
- The coefficients satisfy the Pascals recurrence.
- The binomial coefficents are denoted by and it is read by n choose k.
- It is the coefficient of the term in the polynomial expansion of the binomial thorem .
- The coefficient is occur in the formula of binomial thorem:
,where .
- To find the coefficient of the binomial ,we can use several methods.
1. Recursive formula 2. Multiplicative formula 3. Factorial formula.
- 1.Recursive Formula:
for and .
- 2. Multiplicative formula:
- 3.Factorial formula:
where ,and which is zero when .
- Also for the initial values for .
- Most compact formula for the coefficient of the binomial value is Factorial formula.
- Factorial formula is symmetric of the combination formula.
Examples
- =BINOMIAL(10,3)= 120
- =BINOMIAL(20,7)= 77520
- =BINOMIAL(15,0)= 1
- =BINOMIAL(12,12)=1
- =BINOMIAL(1,-1) = 0