Numerical infinities applied for studying Riemann series theorem and Ramanujan summation

In AIP Conference Proceedings 1978. AIP. pp. 020004 (2018)
  Copy   BIBTEX

Abstract

A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies studying infinities and infinitesimals only symbolically. The grossone methodology uses the Euclid’s Common Notion no. 5 ‘The whole is greater than the part’ and applies it to finite, infinite, and infinitesimal quantities and to finite and infinite sets and processes. It does not contradict Cantor’s and non-standard analysis views on infinity and can be considered as an applied development of their ideas. In this paper we consider infinite series and a particular attention is dedicated to divergent series with alternate signs. The Riemann series theorem states that conditionally convergent series can be rearranged in such a way that they either diverge or converge to an arbitrary real number. It is shown here that Riemann’s result is a consequence of the fact that symbol ∞ used traditionally does not allow us to express quantitatively the number of addends in the series, in other words, it just shows that the number of summands is infinite and does not allows us to count them. The usage of the grossone methodology allows us to see that (as it happens in the case where the number of addends is finite) rearrangements do not change the result for any sum with a fixed infinite number of summands. There are considered some traditional summation techniques such as Ramanujan summation producing results where to divergent series containing infinitely many positive integers negative results are assigned. It is shown that the careful counting of the number of addends in infinite series allows us to avoid this kind of results if grossone-based numerals are used.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Lagrange Lecture: Methodology of numerical computations with infinities and infinitesimals.Yaroslav Sergeyev - 2010 - Rendiconti Del Seminario Matematico dell'Università E Del Politecnico di Torino 68 (2):95–113.
The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area.Yaroslav Sergeyev - 2016 - Communications in Nonlinear Science and Numerical Simulation 31 (1-3):21–29.
Computational Aspects of Hamburger’s Theorem.Yuri Matiyasevich - 2019 - In James Robert Brown, Shaoshi Chen, Robert M. Corless, Ernest Davis, Nicolas Fillion, Max Gunzburger, Benjamin C. Jantzen, Daniel Lichtblau, Yuri Matiyasevich, Robert H. C. Moir, Mark Wilson & James Woodward (eds.), Algorithms and Complexity in Mathematics, Epistemology, and Science: Proceedings of 2015 and 2016 Acmes Conferences. Springer New York. pp. 195-223.
UN SEMPLICE MODO PER TRATTARE LE GRANDEZZE INFINITE ED INFINITESIME.Yaroslav Sergeyev - 2015 - la Matematica Nella Società E Nella Cultura: Rivista Dell’Unione Matematica Italiana, Serie I 8:111-147.
Varieties of Finitism.Manuel Bremer - 2007 - Metaphysica 8 (2):131-148.

Analytics

Added to PP
2020-12-12

Downloads
413 (#48,718)

6 months
130 (#29,890)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Sergeyev
Università della Calabria

References found in this work

No references found.

Add more references