Abstract
The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number of items, in this paper, we look at the Riemann Hypothesis using a new applied approach to infinity allowing one to easily execute numerical computations with various infinite and infinitesimal numbers in accordance with the principle ‘The part is less than the whole’ observed in the physical world around us. The new approach allows one to work with functions and derivatives that can assume not only finite but also infinite and infinitesimal values and this possibility is used to study properties of the Riemann zeta function and the Dirichlet eta function. A new computational approach allowing one to evaluate these functions at certain points is proposed. Numerical examples are given. It is emphasized that different mathematical languages can be used to describe mathematical objects with different accuracies. The traditional and the new approaches are compared with respect to their application to the Riemann zeta function and the Dirichlet eta function. The accuracy of the obtained results is discussed in detail.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Balazard and O. V. Castaë∈n, “Sur l’infimum des parties réelles des zéros des sommes partielles de la fonction zêta de Riemann,” http://front.math.ucdavis.edu/0902.0923, (2009).
W. H. Beyer, ed., CRC Standard Mathematical Tables (CRC Press, West Palm Beach, Fla., 1978).
P. Borwein, G. Fee, R. Ferguson and A. van der Waal, “Zeros of partial summs of the Riemann zeta function,” Experiment.Math. 16(1), 21–40 (2007).
J. Brian Conrey, “The Riemann hypothesis,” Notices Amer.Math. Soc. 50(3), 341–353 (2003).
S. De Cosmis and R. De Leone, “The use of grossone in Mathematical Programming and Operations Research,” submitted.
L. D’Alotto, “Cellular automata using infinite computations,” submitted.
H.M. Edwards, Riemann’s Zeta Function (Dover Publ., New York, 2001).
L. Euler, “De seriebus quibusdam considerationes,” Commentarii academiae scientarium Petropolitanae 12, 53–96; Opera omnia, Series prima XIV, pp. 407–461 (1740).
L. Euler, “De seriebus divergentibus,” Novi commentarii academiae scientarium Petropolitanae 5, 205–237; Opera omnia, Series prima XIV, pp. 585–617 (1754–1755).
L. Euler, “Remarques sur un beau rapport entre les series des puissances tant directes que reciproques,” Memoires de lacademie des sciences de Berlin 17, 83–106; Opera omnia, Series primaXV, pp. 70–90 (1761).
L. Euler, An Introduction to the Analysis of the Infinite, translated by John D. Blanton (Springer-Verlag, New York, 1988).
P. Gordon, “Numerical cognition without words: Evidence from Amazonia,” Science 306, 496–499 (2004).
K. Knopp, Theory and Application of Infinite Series (Dover Publ., New York, 1990).
M. Margenstern, “An application of grossone to the study of a family of tilings of the hyperbolic plane,” Appl. Math. Comp., to appear.
Ya. D. Sergeyev, Arithmetic of Infinity (Edizioni Orizzonti Meridionali, CS, 2003).
Ya. D. Sergeyev, http://www.theinfinitycomputer.com, (2004).
Ya. D. Sergeyev, “A new applied approach for executing computations with infinite and infinitesimal quantities,” Informatica 19(4), 567–596 (2008).
Ya. D. Sergeyev, “Numerical computations and mathematical modelling with infinite and infinitesimal numbers,” J. Appl.Math. Comp. 29, 177–195 (2009).
Ya. D. Sergeyev, “Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains,” Nonlin. Anal. Series A: Theory, Methods & Appl. 71(12), e1688–e1707 (2009).
Ya. D. Sergeyev, “Counting systems and the First Hilbert problem,” Nonlin. Anal. Series A: Theory,Methods & Appl. 72(3–4), 1701–1708 (2010).
Ya. D. Sergeyev, “Lagrange lecture: methodology of numerical computations with infinities and infinitesimals,” Rendiconti del Seminario Matematico dell’Universit à e del Politecnico di Torino 68(2), 95–113 (2010).
Ya.D. Sergeyev, “Higher order numerical differentiation on the Infinity Computer,” Optimization Lett. (2011), to appear.
Ya. D. Sergeyev and A. Garro, “Observability of Turingmachines: A refinement of the theory of computation,” Informatica 21(3), 425–454 (2010).
R. Spira, “Zeros of sections of the zeta function. I,” Math. Comp. 20(96), 542–550 (1966).
Author information
Authors and Affiliations
Corresponding author
Additional information
The text was submitted by the author in English.
Rights and permissions
About this article
Cite this article
Sergeyev, Y.D. On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function. P-Adic Num Ultrametr Anal Appl 3, 129–148 (2011). https://doi.org/10.1134/S2070046611020051
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S2070046611020051