enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Divergence of the sum of the reciprocals of the primes

    en.wikipedia.org/wiki/Divergence_of_the_sum_of...

    It is almost certain that Euler meant that the sum of the reciprocals of the primes less than n is asymptotic to log log n as n approaches infinity. It turns out this is indeed the case, and a more precise version of this fact was rigorously proved by Franz Mertens in 1874. [3] Thus Euler obtained a correct result by questionable means.

  3. Divergent series - Wikipedia

    en.wikipedia.org/wiki/Divergent_series

    Euler summation is essentially an explicit form of analytic continuation. If a power series converges for small complex z and can be analytically continued to the open disk with diameter from ⁠ −1 / q + 1 ⁠ to 1 and is continuous at 1, then its value at q is called the Euler or (E,q) sum of the series Σa n. Euler used it before analytic ...

  4. Euler summation - Wikipedia

    en.wikipedia.org/wiki/Euler_summation

    Given a series Σa n, if its Euler transform converges to a sum, then that sum is called the Euler sum of the original series. As well as being used to define values for divergent series, Euler summation can be used to speed the convergence of series. Euler summation can be generalized into a family of methods denoted (E, q), where q ≥ 0. The ...

  5. Harmonic series (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Harmonic_series_(mathematics)

    Because it is a divergent series, it should be interpreted as a formal sum, an abstract mathematical expression combining the unit fractions, rather than as something that can be evaluated to a numeric value. There are many different proofs of the divergence of the harmonic series, surveyed in a 2006 paper by S. J. Kifowit and T. A. Stamps. [13]

  6. 1 + 2 + 3 + 4 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_%E...

    Most of the more elementary definitions of the sum of a divergent series are stable and linear, and any method that is both stable and linear cannot sum 1 + 2 + 3 + ⋯ to a finite value (see § Heuristics below). More advanced methods are required, such as zeta function regularization or Ramanujan summation.

  7. Riemann zeta function - Wikipedia

    en.wikipedia.org/wiki/Riemann_zeta_function

    The values of the Riemann zeta function at even positive integers were computed by Euler. The first of them, ζ(2), provides a solution to the Basel problem. In 1979 Roger Apéry proved the irrationality of ζ. The values at negative integer points, also found by Euler, are rational numbers and play an important role in the theory of modular forms.

  8. 1 − 2 + 3 − 4 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%E2%88%92_2_%2B_3_%E2%88...

    The threefold Cauchy product of 1 − 1 + 1 − 1 + ... is 1 − 3 + 6 − 10 + ..., the alternating series of triangular numbers; its Abel and Euler sum is 1 ⁄ 8. [16] The fourfold Cauchy product of 1 − 1 + 1 − 1 + ... is 1 − 4 + 10 − 20 + ..., the alternating series of tetrahedral numbers , whose Abel sum is 1 ⁄ 16 .

  9. Basel problem - Wikipedia

    en.wikipedia.org/wiki/Basel_problem

    The sum of the series is approximately equal to 1.644934. [3] The Basel problem asks for the exact sum of this series (in closed form), as well as a proof that this sum is correct. Euler found the exact sum to be / and announced this discovery in 1735. His arguments were based on manipulations that were not justified at the time, although he ...