Computing prime harmonic sums

DOI10.1090/S0025-5718-09-02249-2MaRDI QIDQ3055200zbMATH OpenOpenAlexFDO

Authors Eric Bach, Dominic Klyve, 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

zbMATH Keywords

algorithmMeissel-Lehmer algorithmprime harmonic sum

Mathematics Subject Classification ID

Distribution of primes (11N05) Number-theoretic algorithms; complexity (11Y16) Analytic computations (11Y35)

Recommendations

• Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
• scientific article; zbMATH DE number 2147625
• Computing π(x): An analytic method
• Computing \(\pi(x)\) analytically
• Computing π(x): The Meissel-Lehmer Method

Cites work

• scientific article; zbMATH DE number 1643933 (Why is no real title available?)
• scientific article; zbMATH DE number 4216820 (Why is no real title available?)
• scientific article; zbMATH DE number 1186940 (Why is no real title available?)
• scientific article; zbMATH DE number 1231230 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1544184 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3081798 (Why is no real title available?)
• scientific article; zbMATH DE number 3108056 (Why is no real title available?)
• A floating-point technique for extending the available precision
• Algorithmic Number Theory
• Arithmetical functions with periodic zeros
• Computation of Tangent, Euler, and Bernoulli Numbers
• Computing π(x): An analytic method
• Computing π(x): The Meissel-Lehmer Method
• Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
• Design, implementation and testing of extended and mixed precision BLAS
• Euler constants for arithmetic progressions
• Fast Multiple-Precision Evaluation of Elementary Functions
• On the exact number of primes less than a given limit
• PRIMES is in P
• Software for Doubled-Precision Floating-Point Computations
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• The First Occurrence of Large Gaps Between Successive Primes
• The complexity of number-theoretic constants
• Über die kleinste quadratfreie Zahl einer arithmetischen Reihe

Cited in

(7)

• Computing π(x): An analytic method
• Primary pseudoperfect numbers, arithmetic progressions, and the Erdős-Moser equation
• Maximal product of primes whose sum is bounded
• Forbidden integer ratios of consecutive power sums
• Landau's function for one million billions
• Moser's mathemagical work on the equation 1ᵏ+2ᵏ++(m-1)^k=m^k
• New results for witnesses of Robin's criterion

Describes a project that uses

Uses Software

• XBLAS
• NTL

This page was built for publication: Computing prime harmonic sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055200)