Mathematics of Computation · 1979 · 45 citations · 12 references
Natural SciencesMathematicsCombinatoricsNumber TheoryPhilosophy Of MathematicsArithmetic GeometryCombinatorial Number TheoryRiemann Zeta Function
We describe a computation which shows that the Riemann zeta function $\zeta (s)$ has exactly 75,000,000 zeros of the form $\sigma + it$ it in the region $0 < t < 32,585,736.4$; all these zeros are simple and lie on the line $\sigma = 1/2$. (A similar result for the first 3,500,000 zeros was established by Rosser, Yohe and Schoenfeld.) Counts of the number of Gram blocks of various types and the number of failures of "Rosserâs rule" are given.
12
Rounding Errors in Algebraic Processes
A. S. H., J. H. Wilkinson · Mathematics of Computation · 1964 · 428 citations