|
Vandermonde Identity
In combinatorics, Vandermonde's identity (or Vandermonde's convolution) is the following identity for binomial coefficients: :=\sum_^r for any nonnegative integers ''r'', ''m'', ''n''. The identity is named after Alexandre-Théophile Vandermonde (1772), although it was already known in 1303 by the Chinese mathematician Zhu Shijie.See for the history. There is a ''q''-analog to this theorem called the ''q''-Vandermonde identity. Vandermonde's identity can be generalized in numerous ways, including to the identity : = \sum_ \cdots . Proofs Algebraic proof In general, the product of two polynomials with degrees ''m'' and ''n'', respectively, is given by :\biggl(\sum_^m a_ix^i\biggr) \biggl(\sum_^n b_jx^j\biggr) = \sum_^\biggl(\sum_^r a_k b_\biggr) x^r, where we use the convention that ''ai'' = 0 for all integers ''i'' > ''m'' and ''bj'' = 0 for all integers ''j'' > ''n''. By the binomial theorem, :(1+x)^ = \sum_^ x^r. Usi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is gra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binomial Series
In mathematics, the binomial series is a generalization of the polynomial that comes from a binomial formula expression like (1+x)^n for a nonnegative integer n. Specifically, the binomial series is the Taylor series for the function f(x)=(1+x)^ centered at x = 0, where \alpha \in \Complex and , x, 0 and diverges to +\infty if \operatorname\alpha<0. If , then converges if and only if the sequence converges , which is certainly true if but false if : in the latter case the sequence is dense , due to the fact that diverges and converges to zero). Summation of the binomial series The usual argument to compute the sum of the binomial series goes as follows.[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Factorial And Binomial Topics
In mathematics, the factorial of a non-negative denoted is the product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &= n \times (n-1) \times (n-2) \times (n-3) \times \cdots \times 3 \times 2 \times 1 \\ &= n\times(n-1)!\\ \end For example, 5! = 5\times 4! = 5 \times 4 \times 3 \times 2 \times 1 = 120. The value of 0! is 1, according to the convention for an empty product. Factorials have been discovered in several ancient cultures, notably in Indian mathematics in the canonical works of Jain literature, and by Jewish mystics in the Talmudic book '' Sefer Yetzirah''. The factorial operation is encountered in many areas of mathematics, notably in combinatorics, where its most basic use counts the possible distinct sequences – the permutations – of n distinct objects: there In mathematical analysis, factorials are used in power series for the exponential function ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hockey-stick Identity
In combinatorial mathematics, the identity : \sum^n_= \qquad \text n,r\in\mathbb, \quad n\geq r or equivalently, the mirror-image by the substitution j\to i-r: : \sum^_=\sum^_= \qquad \text n,r\in\mathbb, \quad n\geq r is known as the hockey-stick, Christmas stocking identity, boomerang identity, or Chu's Theorem. The name stems from the graphical representation of the identity on Pascal's triangle: when the addends represented in the summation and the sum itself are highlighted, the shape revealed is vaguely reminiscent of those objects (see hockey stick, Christmas stocking). Proofs Generating function proof We have :X^r + X^ + \dots + X^ = \frac Let X=1+x, and compare coefficients of x^r. Inductive and algebraic proofs The inductive and algebraic proofs both make use of Pascal's identity: :=+. Inductive proof This identity can be proven by mathematical induction on n. Base case Let n=r; :\sum^n_ = \sum^r_= = 1 = = . Inductive step Suppose, for some k\in\math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pascal's Identity
In mathematics, Pascal's rule (or Pascal's formula) is a combinatorial identity about binomial coefficients. It states that for positive natural numbers ''n'' and ''k'', + = , where \tbinom is a binomial coefficient; one interpretation of the coefficient of the term in the expansion of . There is no restriction on the relative sizes of and , since, if the value of the binomial coefficient is zero and the identity remains valid. Pascal's rule can also be viewed as a statement that the formula \frac = = solves the linear two-dimensional difference equation N_ = N_ + N_, \quad N_ = N_ = 1 over the natural numbers. Thus, Pascal's rule is also a statement about a formula for the numbers appearing in Pascal's triangle. Pascal's rule can also be generalized to apply to multinomial coefficients. Combinatorial proof Pascal's rule has an intuitive combinatorial meaning, that is clearly expressed in this counting proof. ''Proof''. Recall that \tbinom equals the number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypergeometric Distribution
In probability theory and statistics, the hypergeometric distribution is a discrete probability distribution that describes the probability of k successes (random draws for which the object drawn has a specified feature) in n draws, ''without'' replacement, from a finite population of size N that contains exactly K objects with that feature, wherein each draw is either a success or a failure. In contrast, the binomial distribution describes the probability of k successes in n draws ''with'' replacement. Definitions Probability mass function The following conditions characterize the hypergeometric distribution: * The result of each draw (the elements of the population being sampled) can be classified into one of two mutually exclusive categories (e.g. Pass/Fail or Employed/Unemployed). * The probability of a success changes on each draw, as each draw decreases the population (''sampling without replacement'' from a finite population). A random variable X follows the hyperg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability Distribution
In probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of different possible outcomes for an experiment. It is a mathematical description of a random phenomenon in terms of its sample space and the probabilities of events (subsets of the sample space). For instance, if is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution of would take the value 0.5 (1 in 2 or 1/2) for , and 0.5 for (assuming that the coin is fair). Examples of random phenomena include the weather conditions at some future date, the height of a randomly selected person, the fraction of male students in a school, the results of a survey to be conducted, etc. Introduction A probability distribution is a mathematical description of the probabilities of events, subsets of the sample space. The sample space, often denoted by \Omega, is the set of all possible outcomes of a random phe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rothe–Hagen Identity
In mathematics, the Rothe–Hagen identity is a mathematical identity valid for all complex numbers (x, y, z) except where its denominators vanish: :\sum_^n\frac\frac=\frac. It is a generalization of Vandermonde's identity, and is named after Heinrich August Rothe and Johann Georg Hagen Johann (John) Georg Hagen (March 6, 1847 – September 6, 1930) was an Austrian Jesuit priest and astronomer. After serving as Director of the Georgetown University Observatory he was called to Rome by Pope Pius X in 1906 to be the first Je .... References *. *. See especially pp. 89–91. *. As cited by . *. *. As cited by . Factorial and binomial topics Mathematical identities Complex analysis {{mathapplied-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gamma Function
In mathematics, the gamma function (represented by , the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer , \Gamma(n) = (n-1)!\,. Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral: \Gamma(z) = \int_0^\infty t^ e^\,dt, \ \qquad \Re(z) > 0\,. The gamma function then is defined as the analytic continuation of this integral function to a meromorphic function that is holomorphic in the whole complex plane except zero and the negative integers, where the function has simple poles. The gamma function has no zeroes, so the reciprocal gamma function is an entire function. In fact, the gamma function corresponds to the Mellin transform of the negative exponential function: \Gamma(z) = \mathcal M \ (z ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binomial Type
In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers \left\ in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities :p_n(x+y)=\sum_^n\, p_k(x)\, p_(y). Many such sequences exist. The set of all such sequences forms a Lie group under the operation of umbral composition, explained below. Every sequence of binomial type may be expressed in terms of the Bell polynomials. Every sequence of binomial type is a Sheffer sequence (but most Sheffer sequences are not of binomial type). Polynomial sequences put on firm footing the vague 19th century notions of umbral calculus. Examples * In consequence of this definition the binomial theorem can be stated by saying that the sequence is of binomial type. * The sequence of " lower factorials" is defined by(x)_n=x(x-1)(x-2)\cdot\cdots\cdot(x-n+1).(In the theory of special functions, this same notation denotes upper fa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Probability Distribution")
