List of mathematical series

From Wikipedia, the free encyclopedia
(Redirected from Partial sum formulae)
Jump to navigation Jump to search

Template:Short description Script error: No such module "Labelled list hatnote".

This list of mathematical series contains formulae for finite and infinite sums. It can be used in conjunction with other tools for evaluating sums.

Sums of powers

See Faulhaber's formula.

  • ∑k=0mkn−1=Bn(m+1)−Bnn

The first few values are:

  • ∑k=1mk=m(m+1)2
  • ∑k=1mk2=m(m+1)(2m+1)6=m33+m22+m6
  • ∑k=1mk3=[m(m+1)2]2=m44+m32+m24

See zeta constants.

  • ζ(2n)=∑k=1∞1k2n=(−1)n+1B2n(2π)2n2(2n)!

The first few values are:

  • ζ(2)=∑k=1∞1k2=π26 (the Basel problem)
  • ζ(4)=∑k=1∞1k4=π490
  • ζ(6)=∑k=1∞1k6=π6945

Power series

Low-order polylogarithms

Finite sums:

  • ∑k=mnzk=zm−zn+11−z, (geometric series)
  • ∑k=0nzk=1−zn+11−z
  • ∑k=1nzk=1−zn+11−z−1=z−zn+11−z
  • ∑k=1nkzk=z1−(n+1)zn+nzn+1(1−z)2
  • ∑k=1nk2zk=z1+z−(n+1)2zn+(2n2+2n−1)zn+1−n2zn+2(1−z)3
  • ∑k=0nkmzk=(zddz)m1−zn+11−z

Infinite sums, valid for |z|<1 (see polylogarithm):

  • Lin(z)=∑k=1∞zkkn

The following is a useful property to calculate low-integer-order polylogarithms recursively in closed form:

  • ddzLin(z)=Lin−1(z)z
  • Li1(z)=∑k=1∞zkk=−ln⁡(1−z)
  • Li0(z)=∑k=1∞zk=z1−z
  • Li−1(z)=∑k=1∞kzk=z(1−z)2
  • Li−2(z)=∑k=1∞k2zk=z(1+z)(1−z)3
  • Li−3(z)=∑k=1∞k3zk=z(1+4z+z2)(1−z)4
  • Li−4(z)=∑k=1∞k4zk=z(1+z)(1+10z+z2)(1−z)5

Exponential function

  • ∑k=0∞zkk!=ez
  • ∑k=0∞kzkk!=zez (cf. mean of Poisson distribution)
  • ∑k=0∞k2zkk!=(z+z2)ez (cf. second moment of Poisson distribution)
  • ∑k=0∞k3zkk!=(z+3z2+z3)ez
  • ∑k=0∞k4zkk!=(z+7z2+6z3+z4)ez
  • ∑k=0∞knzkk!=zddz∑k=0∞kn−1zkk!=ezTn(z)

where Tn(z) is the Touchard polynomials.

Trigonometric, inverse trigonometric, hyperbolic, and inverse hyperbolic functions relationship

  • ∑k=0∞(−1)kz2k+1(2k+1)!=sin⁡z
  • ∑k=0∞z2k+1(2k+1)!=sinh⁡z
  • ∑k=0∞(−1)kz2k(2k)!=cos⁡z
  • ∑k=0∞z2k(2k)!=cosh⁡z
  • ∑k=1∞(−1)k−1(22k−1)22kB2kz2k−1(2k)!=tan⁡z,|z|<π2
  • ∑k=1∞(22k−1)22kB2kz2k−1(2k)!=tanh⁡z,|z|<π2
  • ∑k=0∞(−1)k22kB2kz2k−1(2k)!=cot⁡z,|z|<π
  • ∑k=0∞22kB2kz2k−1(2k)!=coth⁡z,|z|<π
  • ∑k=0∞(−1)k−1(22k−2)B2kz2k−1(2k)!=csc⁡z,|z|<π
  • ∑k=0∞−(22k−2)B2kz2k−1(2k)!=csch⁡z,|z|<π
  • ∑k=0∞(−1)kE2kz2k(2k)!=sech⁡z,|z|<π2
  • ∑k=0∞E2kz2k(2k)!=sec⁡z,|z|<π2
  • ∑k=1∞(−1)k−1z2k(2k)!=ver⁡z (versine)
  • ∑k=1∞(−1)k−1z2k2(2k)!=hav⁡z[1] (haversine)
  • ∑k=0∞(2k)!z2k+122k(k!)2(2k+1)=arcsin⁡z,|z|≤1
  • ∑k=0∞(−1)k(2k)!z2k+122k(k!)2(2k+1)=arcsinh⁡z,|z|≤1
  • ∑k=0∞(−1)kz2k+12k+1=arctan⁡z,|z|<1
  • ∑k=0∞z2k+12k+1=arctanh⁡z,|z|<1
  • ln⁡2+∑k=1∞(−1)k−1(2k)!z2k22k+1k(k!)2=ln⁡(1+1+z2),|z|≤1
  • ∑k=2∞(k⋅arctanh⁡(1k)−1)=3−ln⁡(4π)2

Modified-factorial denominators

  • ∑k=0∞(4k)!24k2(2k)!(2k+1)!zk=1−1−zz,|z|<1[2]
  • ∑k=0∞22k(k!)2(k+1)(2k+1)!z2k+2=(arcsin⁡z)2,|z|≤1[2]
  • ∑n=0∞∏k=0n−1(4k2+α2)(2n)!z2n+∑n=0∞α∏k=0n−1[(2k+1)2+α2](2n+1)!z2n+1=eαarcsin⁡z,|z|≤1

Binomial coefficients

Harmonic numbers

(See harmonic numbers, themselves defined Hn=∑j=1n1j, and H(x) generalized to the real numbers)

  • ∑k=1∞Hkzk=−ln⁡(1−z)1−z,|z|<1
  • ∑k=1∞Hkk+1zk+1=12[ln⁡(1−z)]2,|z|<1
  • ∑k=1∞(−1)k−1H2k2k+1z2k+1=12arctan⁡zlog⁡(1+z2),|z|<1[2]
  • ∑n=0∞∑k=02n(−1)k2k+1z4n+24n+2=14arctan⁡zlog⁡1+z1−z,|z|<1[2]
  • ∑n=0∞x2n2(n+x)=xπ26−H(x)

Binomial coefficients

Script error: No such module "Labelled list hatnote".

  • ∑k=0n(nk)=2n
  • ∑k=0n(nk)2=(2nn)
  • ∑k=0n(−1)k(nk)=0, where n≥1
  • ∑k=0n(km)=(n+1m+1)
  • ∑k=0n(m+k−1k)=(n+mn) (see Multiset)
  • ∑k=0n(αk)(βn−k)=(α+βn),where α+β≥n (see Vandermonde identity)
  • ∑A ∈ 𝒫(E)1=2n, where E is a finite set, and card(E) = n
  • ∑{(A, B) ∈ (𝒫(E))2A ⊂ B1=3n, where E is a finite set, and card(E) = n
  • ∑A ∈ 𝒫(E)card(A)=n2n−1, where E is a finite set, and card(E) = n

Trigonometric functions

Sums of sines and cosines arise in Fourier series.

  • ∑k=1∞cos⁡(kθ)k=−12ln⁡(2−2cos⁡θ)=−ln⁡(2sin⁡θ2),0<θ<2π
  • ∑k=1∞sin⁡(kθ)k=π−θ2,0<θ<2π
  • ∑k=1∞(−1)k−1kcos⁡(kθ)=12ln⁡(2+2cos⁡θ)=ln⁡(2cos⁡θ2),0≤θ<π
  • ∑k=1∞(−1)k−1ksin⁡(kθ)=θ2,−π2≤θ≤π2
  • ∑k=1∞cos⁡(2kθ)2k=−12ln⁡(2sin⁡θ),0<θ<π
  • ∑k=1∞sin⁡(2kθ)2k=π−2θ4,0<θ<π
  • ∑k=0∞cos⁡[(2k+1)θ]2k+1=12ln⁡(cot⁡θ2),0<θ<π
  • ∑k=0∞sin⁡[(2k+1)θ]2k+1=π4,0<θ<π,[4]
  • ∑k=1∞sin⁡(2πkx)k=π(12−{x}), x∈ℝ
  • ∑k=1∞sin⁡(2πkx)k2n−1=(−1)n(2π)2n−12(2n−1)!B2n−1({x}), x∈ℝ, n∈ℕ
  • ∑k=1∞cos⁡(2πkx)k2n=(−1)n−1(2π)2n2(2n)!B2n({x}), x∈ℝ, n∈ℕ
  • Bn(x)=−n!2n−1πn∑k=1∞1kncos⁡(2πkx−πn2),0<x<1[5]
  • ∑k=0nsin⁡(θ+kα)=sin⁡(n+1)α2sin⁡(θ+nα2)sin⁡α2
  • ∑k=0ncos⁡(θ+kα)=sin⁡(n+1)α2cos⁡(θ+nα2)sin⁡α2
  • ∑k=1n−1sin⁡πkn=cot⁡π2n
  • ∑k=1n−1sin⁡2πkn=0
  • ∑k=0n−1csc2(θ+πkn)=n2csc2(nθ)[6]
  • ∑k=1n−1csc2πkn=n2−13
  • ∑k=1n−1csc4πkn=n4+10n2−1145

Rational functions

  • ∑n=a+1∞an2−a2=12H2a[7]
  • ∑n=0∞1n2+a2=1+aπcoth⁡(aπ)2a2
  • ∑n=0∞(−1)nn2+a2=1+aπcsch(aπ)2a2
  • ∑n=0∞(2n+1)(−1)n(2n+1)2+a2=π4sech(aπ2)
  • ∑n=0∞1n4+4a4=18a4+π(sinh⁡(2πa)+sin⁡(2πa))8a3(cosh⁡(2πa)−cos⁡(2πa))
  • An infinite series of any rational function of n can be reduced to a finite series of polygamma functions, by use of partial fraction decomposition,[8] as explained here. This fact can also be applied to finite series of rational functions, allowing the result to be computed in constant time even when the series contains a large number of terms.

Exponential function

  • 1p∑n=0p−1exp⁡(2πin2qp)=eπi/42q∑n=02q−1exp⁡(−πin2p2q)(see the Landsberg–Schaar relation)
  • ∑n=−∞∞e−πn2=π4Γ(34)

Numeric series

These numeric series can be found by plugging in numbers from the series listed above.

Alternating harmonic series

  • ∑k=1∞(−1)k+1k=11−12+13−14+⋯=ln⁡2
  • ∑k=1∞(−1)k+12k−1=11−13+15−17+19−⋯=π4

Sum of reciprocal of factorials

  • ∑k=0∞1k!=10!+11!+12!+13!+14!+⋯=e
  • ∑k=0∞1(2k)!=10!+12!+14!+16!+18!+⋯=12(e+1e)=cosh⁡1
  • ∑k=0∞1(3k)!=10!+13!+16!+19!+112!+⋯=13(e+2ecos⁡32)
  • ∑k=0∞1(4k)!=10!+14!+18!+112!+116!+⋯=12(cos⁡1+cosh⁡1)

Trigonometry and π

  • ∑k=0∞(−1)k(2k+1)!=11!−13!+15!−17!+19!+⋯=sin⁡1
  • ∑k=0∞(−1)k(2k)!=10!−12!+14!−16!+18!+⋯=cos⁡1
  • ∑k=1∞1k2+1=12+15+110+117+⋯=12(πcoth⁡π−1)
  • ∑k=1∞(−1)kk2+1=−12+15−110+117+⋯=12(πcsch⁡π−1)
  • 3+42×3×4−44×5×6+46×7×8−48×9×10+⋯=π

Reciprocal of tetrahedral numbers

  • ∑k=1∞1Tek=11+14+110+120+135+⋯=32

Where Ten=∑k=1nTk

Exponential and logarithms

  • ∑k=0∞1(2k+1)(2k+2)=11×2+13×4+15×6+17×8+19×10+⋯=ln⁡2
  • ∑k=1∞12kk=12+18+124+164+1160+⋯=ln⁡2
  • ∑k=1∞(−1)k+12kk+∑k=1∞(−1)k+13kk=(12+13)−(18+118)+(124+181)−(164+1324)+⋯=ln⁡2
  • ∑k=1∞13kk+∑k=1∞14kk=(13+14)+(118+132)+(181+1192)+(1324+11024)+⋯=ln⁡2
  • ∑k=1∞1nkk=ln⁡(nn−1), that is ∀n>1

See also

<templatestyles src="Div col/styles.css"/>

Notes

<templatestyles src="Reflist/styles.css" />

  1. ↑ Script error: No such module "citation/CS1".
  2. ↑ a b c d Script error: No such module "citation/CS1".
  3. ↑ a b c d Script error: No such module "citation/CS1".
  4. ↑ Calculate the Fourier expansion of the function f(x)=π4 on the interval 0<x<π:
    • π4=∑n=0∞cnsin⁡[nx]+dncos⁡[nx]
    ⇒{cn={1n(n odd)0(n even)dn=0(∀n)
  5. ↑ Script error: No such module "citation/CS1".
  6. ↑ Script error: No such module "citation/CS1".
  7. ↑ Script error: No such module "citation/CS1".
  8. ↑ Script error: No such module "citation/CS1".

Script error: No such module "Check for unknown parameters".

References