Gustavo Colonnetti: Difference between revisions
en>RedBot m r2.7.2) (Robot: Adding pt:Gustavo Colonnetti |
en>GoingBatty m fixed CS1 errors: dates to meet MOS:DATEFORMAT (also General fixes) using AWB (9884) |
||
| Line 1: | Line 1: | ||
In [[mathematics]], a [[Newtonian series]], named after [[Isaac Newton]], is a sum over a [[sequence]] <math>a_n</math> written in the form | |||
:<math>f(s) = \sum_{n=0}^\infty (-1)^n {s\choose n} a_n = \sum_{n=0}^\infty \frac{(-s)_n}{n!} a_n</math> | |||
where | |||
:<math>{s \choose k}</math> | |||
is the [[binomial coefficient]] and <math>(s)_n</math> is the [[rising factorial]]. Newtonian series often appear in relations of the form seen in [[umbral calculus]]. | |||
==List== | |||
The generalized [[binomial theorem]] gives | |||
:<math> (1+z)^{s} = \sum_{n = 0}^{\infty}{s \choose n}z^n = | |||
1+{s \choose 1}z+{s \choose 2}z^2+\cdots.</math> | |||
A proof for this identity can be obtained by showing that it satisfies the differential equation | |||
: <math> (1+z) \frac{d(1+z)^s}{dz} = s (1+z)^s.</math> | |||
The [[digamma function]]: | |||
:<math>\psi(s+1)=-\gamma-\sum_{n=1}^\infty \frac{(-1)^n}{n} {s \choose n}</math> | |||
The [[Stirling numbers of the second kind]] are given by the finite sum | |||
:<math>\left\{\begin{matrix} n \\ k \end{matrix}\right\} | |||
=\frac{1}{k!}\sum_{j=0}^{k}(-1)^{k-j}{k \choose j} j^n.</math> | |||
This formula is a special case of the ''k''th [[forward difference]] of the [[monomial]] ''x''<sup>''n''</sup> evaluated at ''x'' = 0: | |||
:<math> \Delta^k x^n = \sum_{j=0}^{k}(-1)^{k-j}{k \choose j} (x+j)^n.</math> | |||
A related identity forms the basis of the [[Nörlund–Rice integral]]: | |||
:<math>\sum_{k=0}^n {n \choose k}\frac {(-1)^k}{s-k} = | |||
\frac{n!}{s(s-1)(s-2)\cdots(s-n)} = | |||
\frac{\Gamma(n+1)\Gamma(s-n)}{\Gamma(s+1)}= | |||
B(n+1,s-n)</math> | |||
where <math>\Gamma(x)</math> is the [[Gamma function]] and <math>B(x,y)</math> is the [[Beta function]]. | |||
The [[trigonometric function]]s have [[umbral calculus|umbral]] identities: | |||
:<math>\sum_{n=0}^\infty (-1)^n {s \choose 2n} = 2^{s/2} \cos \frac{\pi s}{4}</math> | |||
and | |||
:<math>\sum_{n=0}^\infty (-1)^n {s \choose 2n+1} = 2^{s/2} \sin \frac{\pi s}{4}</math> | |||
The umbral nature of these identities is a bit more clear by writing them in terms of the [[falling factorial]] <math>(s)_n</math>. The first few terms of the sin series are | |||
:<math>s - \frac{(s)_3}{3!} + \frac{(s)_5}{5!} - \frac{(s)_7}{7!} + \cdots\,</math> | |||
which can be recognized as resembling the [[Taylor series]] for sin ''x'', with (''s'')<sub>''n''</sub> standing in the place of ''x''<sup>''n''</sub>. | |||
In [[analytic number theory]] it is of interest to sum | |||
:<math>\!\sum_{k=0}B_k z^k,</math> | |||
where ''B'' are the [[Bernoulli numbers]]. Employing the generating function its Borel sum can be evaluated as | |||
:<math>\sum_{k=0}B_k z^k= \int_0^\infty e^{-t} \frac{t z}{e^{t z}-1}d t= \sum_{k=1}\frac z{(k z+1)^2}.</math> | |||
The general relation gives the Newton series | |||
:<math>\sum_{k=0}\frac{B_k(x)}{z^k}\frac{{1-s\choose k}}{s-1}= z^{s-1}\zeta(s,x+z),</math>{{Citation needed|date=February 2012}} | |||
where <math>\zeta</math> is the [[Hurwitz zeta function]] and <math>B_k(x)</math> the [[Bernoulli polynomials|Bernoulli polynomial]]. The series does not converge, the identity holds formally. | |||
Another identity is | |||
<math>\frac 1{\Gamma(x)}= \sum_{k=0}^\infty {x-a\choose k}\sum_{j=0}^k \frac{(-1)^{k-j}}{\Gamma(a+j)}{k\choose j},</math> | |||
which converges for <math>x>a</math>. This follows from the general form of a Newton series for equidistant nodes (when it exists, i.e. is convergent) | |||
:<math>f(x)=\sum_{k=0}{\frac{x-a}h \choose k} \sum_{j=0}^k (-1)^{k-j}{k\choose j}f(a+j h).</math> | |||
==See also== | |||
* [[Binomial transform]] | |||
* [[List of factorial and binomial topics]] | |||
* [[Nörlund–Rice integral]] | |||
* [[Carlson's theorem]] | |||
==References== | |||
* Philippe Flajolet and Robert Sedgewick, "[http://www-rocq.inria.fr/algo/flajolet/Publications/mellin-rice.ps.gz Mellin transforms and asymptotics: Finite differences and Rice's integrals]", ''Theoretical Computer Science'' ''144'' (1995) pp 101–124. | |||
[[Category:Finite differences]] | |||
[[Category:Factorial and binomial topics]] | |||
[[Category:Mathematics-related lists|Newton series]] | |||
Revision as of 03:43, 23 January 2014
In mathematics, a Newtonian series, named after Isaac Newton, is a sum over a sequence written in the form
where
is the binomial coefficient and is the rising factorial. Newtonian series often appear in relations of the form seen in umbral calculus.
List
The generalized binomial theorem gives
A proof for this identity can be obtained by showing that it satisfies the differential equation
The digamma function:
The Stirling numbers of the second kind are given by the finite sum
This formula is a special case of the kth forward difference of the monomial xn evaluated at x = 0:
A related identity forms the basis of the Nörlund–Rice integral:
where is the Gamma function and is the Beta function.
The trigonometric functions have umbral identities:
and
The umbral nature of these identities is a bit more clear by writing them in terms of the falling factorial . The first few terms of the sin series are
which can be recognized as resembling the Taylor series for sin x, with (s)n standing in the place of xn.
In analytic number theory it is of interest to sum
where B are the Bernoulli numbers. Employing the generating function its Borel sum can be evaluated as
The general relation gives the Newton series
- Potter or Ceramic Artist Truman Bedell from Rexton, has interests which include ceramics, best property developers in singapore developers in singapore and scrabble. Was especially enthused after visiting Alejandro de Humboldt National Park.
where is the Hurwitz zeta function and the Bernoulli polynomial. The series does not converge, the identity holds formally.
Another identity is which converges for . This follows from the general form of a Newton series for equidistant nodes (when it exists, i.e. is convergent)
See also
References
- Philippe Flajolet and Robert Sedgewick, "Mellin transforms and asymptotics: Finite differences and Rice's integrals", Theoretical Computer Science 144 (1995) pp 101–124.