Difference between revisions of "Manuals/calci/BINOMIALCOEFFICIENT"
(→ZOS) |
|||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | <div style="font-size:30px">'''BINOMIAL( | + | <div style="font-size:30px">'''BINOMIAL(N,K)'''</div><br/> |
| − | *<math> | + | *<math>N</math> is the number of items. |
| − | *<math> | + | *<math>K </math> is the number of selection. |
| Line 31: | Line 31: | ||
#=BINOMIAL(32,0)= 1 | #=BINOMIAL(32,0)= 1 | ||
#=BINOMIAL(10,7) = 120 | #=BINOMIAL(10,7) = 120 | ||
| + | |||
| + | ==Related Videos== | ||
| + | |||
| + | {{#ev:youtube|v=07oNEAcZNko|280|center|Binomial coefficient}} | ||
==See Also== | ==See Also== | ||
| Line 39: | Line 43: | ||
*[http://en.wikipedia.org/wiki/Binomial_distribution Binomial Distribution] | *[http://en.wikipedia.org/wiki/Binomial_distribution Binomial Distribution] | ||
*[http://en.wikipedia.org/wiki/Binomial_coefficient Binomial Coefficient] | *[http://en.wikipedia.org/wiki/Binomial_coefficient Binomial Coefficient] | ||
| + | |||
| + | |||
| + | *[[Z_API_Functions | List of Main Z Functions]] | ||
| + | |||
| + | *[[ Z3 | Z3 home ]] | ||
Latest revision as of 15:46, 27 November 2018
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N} is the number of items.
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle K } 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 Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \binom{n}{k}} and it is read by n choose k.
- It is the coefficient of the Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x^k} term in the polynomial expansion of the binomial thorem .
- The coefficient is occur in the formula of binomial thorem:
Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (x+y)^n=\sum _{k=0}^n \binom{n}{k} x^{n-k} y^k}
where Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle k\le n}
.
- To find the coefficient of the binomial ,we can use several methods.
1. Recursive formula 2. Multiplicative formula 3. Factorial formula.
- 1.Recursive Formula:
Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \binom{n}{k}= \binom{n-1}{k-1} +\binom{n-1}{k}}
for Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n,k>0}
and Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 1\leq k\leq n-1}
.
- 2. Multiplicative formula:
Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \binom{n}{k}= \prod_{i=1}^k \frac{n+1-i}{i}}
- 3.Factorial formula:
Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \binom{n}{k}= \frac{n!}{k!(n-k)!}} where Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle k\le n} ,and which is zero when Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle k>n} .
- Also for the initial values for Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n\ge 0} .
- 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(32,0)= 1
- =BINOMIAL(10,7) = 120
Related Videos
See Also
References