You can edit almost every page by Creating an account and confirming your email.

Summation Formula List

From EverybodyWiki Bios & Wiki



In mathematics, summation is the addition of a sequence of numbers. The result is a sum or total. The sum of a sequence of numbers is denoted with an enlarged capital Greek sigma symbol . Summation is used in mathematics to approximate definite integrals; describe statistical distributions and estimators; and denote combinatorial computations.

Terminology

The summation symbol

The sum of a sequence of numbers is denoted by:

i=1nai=a1+a2+a3++an1+an

where i represents the index; ai are the successive terms in the sum; 1 is the lower bound, and n is the upper bound. The index, i, is incremented by 1 for each successive term, stopping when i = n The numbers to be summed are called addends, or sometimes summands. The addends, represented by ai, may be integers, rational numbers, real numbers, or complex numbers. [1]

Formulae

  1. i=1n1=n
  2. i=1nc=nc for every constant c
  3. i=0ni=i=1ni=n(n+1)2 (Sum of the simplest arithmetic progression, consisting of the n first natural numbers.)[2]
  4. i=1n2i1=n2 (Sum of first odd natural numbers)
  5. i=0n2i=n(n+1) (Sum of first even natural numbers)
  6. i=1nlogi=logn! (A sum of logarithms is the logarithm of the product)
  7. i=0ni2=n(n+1)(2n+1)6=n33+n22+n6 (Sum of the first squares, see square pyramidal number.) [2]
  8. i=0ni3=(i=0ni)2=(n(n+1)2)2=n44+n32+n24 (Nicomachus's theorem) [2]
  9. i=0ni4=n(n+1)(2n+1)(3n2+3n1)30=n55+n42+n33n30 [2]
  10. i=1ni5=n2(n+1)2(2n2+2n1)12 [2]
  11. i=1ni6=n(n+1)(2n+1)(3n4+6n33n+1)42 [2]
  12. i=1ni7=n2(n+1)2(3n4+6n3n24n+2)24 [2]
  13. i=1ni8=n(n+1)(2n+1)(5n6+15n5+5n415n3n29n3)90 [2]
  14. i=1ni9=n2(n+1)2(2n6+6n5+n48n3+n2+6n3)20 [2]
  15. i=1ni10=n(n+1)(2n+1)(3n8+12n7+8n618n510n4+24n3+2n215n+5)66 [2]
  16. i=1n3i23i+1=n3 (exact cubic closed form)
  17. i=1n4i36i2+4i1=n4 (exact quartic closed form)
  18. i=1n5i410i3+10i25i+1=n5 (exact quintic closed form)
  19. i=1n6i515i4+20i315i2+6i1=n6 (exact sextic closed form)
  20. i=1n7i621i5+35i435i3+21i27i+1=n7 (exact septic closed form)
  21. i=1n8i728i6+56i570i4+56i328i2+8i1=n8 (exact octic closed form)
  22. i=1n9i836i7+84i6126i5+126i484i3+36i29i+1=n9 (exact nonic closed form)
  23. i=1n10i945i8+120i7210i6+252i5210i4+120i345i2+10i1=n10 (exact decic closed form)
  24. i=0n1ai=1an1a, a1, (see geometric series)
  25. i=0n112i=212n1
  26. i=0n1iai=anan+(n1)an+1(1a)2, a1.
  27. i=0n1i2i=2+(n2)2n
  28. i=0n1i2i=2n+12n1
  29. i=0n1(b+id)ai=b[b+(n1)d]an1a+da(1an1)(1a)2, a1 (see arithmetico-geometric series)
  30. i=0n(ni)=2n (Gives the number of combinations in the binomial distribution)
  31. i=0n(ni)pi(1p)ni=1, 0p1. (The binomial distribution)
  32. k=0m(n+kn)=(n+m+1n+1)
  33. i=1ni(ni)=n(2n1)
  34. i=0n(ni)i+1=2n+11n+1
  35. i=kn(ik)=(n+1k+1)
  36. i=0n(ni)anibi=(a+b)n, the binomial theorem
  37. i=0nii!=(n+1)!1
  38. i=0n(m+i1i)=(m+nn)
  39. i=0n(ni)2=(2nn)

See also

Notes

  1. Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren (1994). "Chapter 2: Sums". Concrete Mathematics: A Foundation for Computer Science (2nd Edition). Addison-Wesley Professional.CS1 maint: Uses authors parameter (link) Search this book on
  2. 2.00 2.01 2.02 2.03 2.04 2.05 2.06 2.07 2.08 2.09 W. H. Boyer (Editor), CRC Standard Math Tables, CRC Press, p 52, 1984

External links

References


This article "Summation Formula List" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Summation Formula List. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.