|
|
|
|
|
|
|
|
|
Binomial coefficient.
|
See combinations.
|
|
Binomial, английский
Биномиальный
Binomial coefficient, английский
- Combinations
- Биномиальный коэффициент
- The binomial coefficient counts the number of ways n items can be partitioned into two groups, one of size k and the other of size n-k. it is computed as see also: binomial distribution, multinomial coefficient.
Binomial distribution, английский
- This is a special case of the multinomial distribution where the number of possible outcomes is 2. it is the distribution of outcomes expected if a certain number of independent trials are undertaken of a single bernouilli process (e.g. multiple tosses of
- A random variable has a binomial distribution (with parameters n and p) if it is the number of "successes" in a fixed number n of independent random trials, all of which have the same probability p of resulting in "success." under these assumptions, the probability of k successes (and n−k failures) is nck pk(1−p)n−k, where nck is the number of combinations of n objects taken k at a time: nck = n!/(k!(n−k)!). the expected value of a random variable with the binomial distribution is n×p, and the standard error of a random variable with the binomial distribution is (n×p×(1 − p))½. this page shows the probability histogram of the binomial distribution.
- Биномиальное распределение
- The binomial distribution is a basic distribution used in modeling collections of binary events. if events in the collection are assumed to have an identical probability of being a "one" and they occur independently, the number of "ones" in the collection will follow a binomial distribution. when the events can each take on the same set of multiple values but are still otherwise identical and independent, the distribution is called a multinomial. a classic example would be the result of a sequence of six-sided die rolls. if you were interested in the number of times the die showed a 1, 2, . . ., 6, the distribution of states would be multinomial. if you were only interested in the probability of a five or a six, without distinguishing them, there would be two states, and the distribution would be binomial. see also: bernoulli process.
- Биномиальное распределение. основано на положении о том, что если в каждом конкретном событии из двух возможных исходов может появиться только один, тогда допустимо применение теоретического распреде-ления различных комбинаций возможных исходов, при условии что количество событий
- Биномиальное распределение. см. distribution (распределение).
- Биномиальное распределение. основано на положении о том, что если в каждом конкретном событии из двух возможных исходов может появиться только один, тогда допустимо применение теоретического распределения различных комбинаций возможных исходов, при условии что количество событий
Binomial distribution., английский
A random variable has a binomial distribution (with parameters n and p) if it is the number of "successes" in a fixed number n of independent random trials, all of which have the same probability p of resulting in "success." under thes
Binomial equation, английский
Двучленное уравнение
Binomial nomenclature, английский
A universal convention for the scientific naming of organisms using latinized names for genus and species
Binomial option pricing model, английский
An option pricing model in which the underlying asset can assume one of only two possible, discrete values in the next time period for each value that it can take on in the preceding time period.
Binomial series, английский
Биномиальный ряд
Binomial test, английский
This is a statistical test referring to a repeated binary process such as would be expected to generate outcomes with a binomial distribution. a value for the parameter 'p' is hypothesised (null hypothesis) and the difference of the actual value from this
Binomial theorem, английский
The binomial theorem says that (x+y)n = xn + nxn−1y + … + nckxn−kyk + … + yn.
Binomial twist, английский
Combinations, английский
The number of combinations of n things taken k at a time is the number of ways of picking a subset of k of the n things, without replacement, and without regard to the order in which the elements of the subset are picked. the number of such combinations is nck = n!/(k!(n−k)!), where k! (pronounced "k factorial") is k×(k−1)×(k−2)× … × 1. the numbers nck are also called the binomial coefficients. from a set that has n elements one can form a total of 2n subsets of all sizes. for example, from the set {a, b, c}, which has 3 elements, one can form the 23 = 8 subsets {}, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}. because the number of subsets with k elements one can form from a set with n elements is nck, and the total number of subsets of a set is the sum of the numbers of possible subsets of each size, it follows that nc0+nc1+nc2+ … +ncn = 2n. the calculator has a button (ncm) that lets you compute the number of combinations of m things chosen from a set of n things. to use the button, first type the value of n, then push the ncm button, then type the value of m, then press the "=" button.
|
Limit., английский
See converge.
Bin., английский
See class interval.
|
|
|
|
|
|
|
