Computing prime harmonic sums
From MaRDI portal
Publication:3055200
DOI10.1090/S0025-5718-09-02249-2zbMath1204.11184OpenAlexW2045047334MaRDI QIDQ3055200
Dominic Klyve, Eric Bach, Jonathan P. Sorenson
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-09-02249-2
Number-theoretic algorithms; complexity (11Y16) Distribution of primes (11N05) Analytic computations (11Y35)
Related Items (6)
Forbidden Integer Ratios of Consecutive Power Sums ⋮ Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation ⋮ Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\) ⋮ Maximal product of primes whose sum is bounded ⋮ Landau's function for one million billions ⋮ New results for witnesses of Robin’s criterion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Über die kleinste quadratfreie Zahl einer arithmetischen Reihe
- On the exact number of primes less than a given limit
- PRIMES is in P
- The complexity of number-theoretic constants
- A floating-point technique for extending the available precision
- Arithmetical functions with periodic zeros
- Computing π(x): The Meissel-Lehmer Method
- Computing π(x): An analytic method
- Software for Doubled-Precision Floating-Point Computations
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Euler constants for arithmetic progressions
- Fast Multiple-Precision Evaluation of Elementary Functions
- Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
- Design, implementation and testing of extended and mixed precision BLAS
- Computation of Tangent, Euler, and Bernoulli Numbers
- The First Occurrence of Large Gaps Between Successive Primes
- Algorithmic Number Theory
This page was built for publication: Computing prime harmonic sums
