|
List Of Mathematical Series
This list of mathematical series contains formulae for finite and infinite sums. It can be used in conjunction with other tools for evaluating sums. *Here, 0^0 Zero to the power of zero, is taken to have the value 1 *\ denotes the fractional part of x *B_n(x) is a Bernoulli polynomial. *B_n is a Bernoulli number, and here, B_1=-\frac. *E_n is an Euler number. *\zeta(s) is the Riemann zeta function. *\Gamma(z) is the gamma function. *\psi_n(z) is a polygamma function. *\operatorname_s(z) is a polylogarithm. * n \choose k is binomial coefficient *\exp(x) denotes Exponential function, exponential of x Sums of powers See Faulhaber's formula. *\sum_^m k^=\frac The first few values are: *\sum_^m k=\frac *\sum_^m k^2=\frac=\frac+\frac+\frac *\sum_^m k^3 =\left[\frac\right]^2=\frac+\frac+\frac See zeta constants. *\zeta(2n)=\sum^_ \frac=(-1)^ \frac The first few values are: *\zeta(2)=\sum^_ \frac=\frac (the Basel problem) *\zeta(4)=\sum^_ \frac=\frac *\zeta(6)=\sum^_ \frac=\frac Pow ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zero To The Power Of Zero
Zero to the power of zero, denoted as , is a mathematical expression with different interpretations depending on the context. In certain areas of mathematics, such as combinatorics and algebra, is conventionally defined as 1 because this assignment simplifies many formulas and ensures consistency in operations involving exponents. For instance, in combinatorics, defining aligns with the interpretation of choosing 0 elements from a set (mathematics), set and simplifies Polynomial expansion, polynomial and binomial expansions. However, in other contexts, particularly in mathematical analysis, is often considered an indeterminate form. This is because the value of as both and approach zero can lead to different results based on the Limit process, limiting process. The expression arises in limit problems and may result in a range of values or diverge to infinity, making it difficult to assign a single consistent value in these cases. The treatment of also varies across different ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Touchard Polynomials
The Touchard polynomials, studied by , also called the exponential polynomials or Bell polynomials, comprise a polynomial sequence of binomial type defined by :T_n(x)=\sum_^n S(n,k)x^k=\sum_^n \left\x^k, where S(n,k)=\left\ is a Stirling number of the second kind, i.e., the number of partitions of a set of size ''n'' into ''k'' disjoint non-empty subsets. The first few Touchard polynomials are :T_1(x)=x, :T_2(x)=x^2+x, :T_3(x)=x^3+3x^2+x, :T_4(x)=x^4+6x^3+7x^2+x, :T_5(x)=x^5+10x^4+25x^3+15x^2+x. Properties Basic properties The value at 1 of the ''n''th Touchard polynomial is the ''n''th Bell number, i.e., the number of partitions of a set of size ''n'': :T_n(1)=B_n. If ''X'' is a random variable with a Poisson distribution with expected value λ, then its ''n''th moment is E(''X''''n'') = ''T''''n''(λ), leading to the definition: :T_(x)=e^\sum_^\infty \frac . Using this fact one can quickly prove that this polynomial sequence is of binomial type, i.e., it s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fourier Series
A Fourier series () is an Series expansion, expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation. This application is possible because the derivatives of trigonometric functions fall into simple patterns. Fourier series cannot be used to approximate arbitrary functions, because most functions have infinitely many terms in their Fourier series, and the series do not always Convergent series, converge. Well-behaved functions, for example Smoothness, smooth functions, have Fourier series that converge to the original function. The coefficients of the Fourier series are determined by integrals of the function multiplied by trigonometric func ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cosine
In mathematics, sine and cosine are trigonometric functions of an angle. The sine and cosine of an acute angle are defined in the context of a right triangle: for the specified angle, its sine is the ratio of the length of the side opposite that angle to the length of the longest side of the triangle (the hypotenuse), and the cosine is the ratio of the length of the adjacent leg to that of the hypotenuse. For an angle \theta, the sine and cosine functions are denoted as \sin(\theta) and \cos(\theta). The definitions of sine and cosine have been extended to any real number, real value in terms of the lengths of certain line segments in a unit circle. More modern definitions express the sine and cosine as Series (mathematics), infinite series, or as the solutions of certain differential equations, allowing their extension to arbitrary positive and negative values and even to complex numbers. The sine and cosine functions are commonly used to model periodic function, periodic pheno ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sine
In mathematics, sine and cosine are trigonometric functions of an angle. The sine and cosine of an acute angle are defined in the context of a right triangle: for the specified angle, its sine is the ratio of the length of the side opposite that angle to the length of the longest side of the triangle (the hypotenuse), and the cosine is the ratio of the length of the adjacent leg to that of the hypotenuse. For an angle \theta, the sine and cosine functions are denoted as \sin(\theta) and \cos(\theta). The definitions of sine and cosine have been extended to any real value in terms of the lengths of certain line segments in a unit circle. More modern definitions express the sine and cosine as infinite series, or as the solutions of certain differential equations, allowing their extension to arbitrary positive and negative values and even to complex numbers. The sine and cosine functions are commonly used to model periodic phenomena such as sound and light waves, the posit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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. U ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiset
In mathematics, a multiset (or bag, or mset) is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. The number of instances given for each element is called the ''multiplicity'' of that element in the multiset. As a consequence, an infinite number of multisets exist that contain only elements and , but vary in the multiplicities of their elements: * The set contains only elements and , each having multiplicity 1 when is seen as a multiset. * In the multiset , the element has multiplicity 2, and has multiplicity 1. * In the multiset , and both have multiplicity 3. These objects are all different when viewed as multisets, although they are the same set, since they all consist of the same elements. As with sets, and in contrast to ''tuples'', the order in which elements are listed does not matter in discriminating multisets, so and denote the same multiset. To distinguish between sets and multisets, a notat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harmonic Number
In mathematics, the -th harmonic number is the sum of the reciprocals of the first natural numbers: H_n= 1+\frac+\frac+\cdots+\frac =\sum_^n \frac. Starting from , the sequence of harmonic numbers begins: 1, \frac, \frac, \frac, \frac, \dots Harmonic numbers are related to the harmonic mean in that the -th harmonic number is also times the reciprocal of the harmonic mean of the first positive integers. Harmonic numbers have been studied since antiquity and are important in various branches of number theory. They are sometimes loosely termed harmonic series, are closely related to the Riemann zeta function, and appear in the expressions of various special functions. The harmonic numbers roughly approximate the natural logarithm function and thus the associated harmonic series grows without limit, albeit slowly. In 1737, Leonhard Euler used the divergence of the harmonic series to provide a new proof of the infinity of prime numbers. His work was extended into the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Central Binomial Coefficient
In mathematics the ''n''th central binomial coefficient is the particular binomial coefficient : = \frac \textn \geq 0. They are called central since they show up exactly in the middle of the even-numbered rows in Pascal's triangle. The first few central binomial coefficients starting at ''n'' = 0 are: :, , , , , , 924, 3432, 12870, 48620, ...; Combinatorial interpretations and other properties The central binomial coefficient \binom is the number of arrangements where there are an equal number of two types of objects. For example, when n=2, the binomial coefficient \binom is equal to 6, and there are six arrangements of two copies of ''A'' and two copies of ''B'': ''AABB'', ''ABAB'', ''ABBA'', ''BAAB'', ''BABA'', ''BBAA''. The same central binomial coefficient \binom is also the number of words of length 2''n'' made up of ''A'' and ''B'' within which, as one reads from left to right, there are never more ''B'' than ''A'' at any point. For example, when n=2, there are six ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Catalan Numbers
The Catalan numbers are a sequence of natural numbers that occur in various Enumeration, counting problems, often involving recursion, recursively defined objects. They are named after Eugène Charles Catalan, Eugène Catalan, though they were previously discovered in the 1730s by Minggatu. The -th Catalan number can be expressed directly in terms of the central binomial coefficients by :C_n = \frac = \frac \qquad\textn\ge 0. The first Catalan numbers for are : . Properties An alternative expression for is :C_n = - for n\ge 0\,, which is equivalent to the expression given above because \tbinom=\tfrac\tbinomn. This expression shows that is an integer, which is not immediately obvious from the first formula given. This expression forms the basis for a #Second proof, proof of the correctness of the formula. Another alternative expression is :C_n = \frac \,, which can be directly interpreted in terms of the cycle lemma; see below. The Catalan numbers satisfy the recurr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Function
In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form (rather than as a series), by some expression involving operations on the formal series. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series. Every sequence in principle has a generating function of each type (except that Lambert and Dirichlet series require indices to start at 1 rather than 0), but the ease with which they can be handled may differ considerably. The particular generating function, if any, that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed. Generating functions are sometimes called generating series, in that a series of terms can be said to be the generator of its sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Haversine
The versine or versed sine is a trigonometric function found in some of the earliest (Sanskrit ''Aryabhatia'', Section I) trigonometric tables. The versine of an angle is 1 minus its . There are several related functions, most notably the coversine and haversine. The latter, half a versine, is of particular importance in the haversine formula of navigation. Overview The versine[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
