Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.11345OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899248

Herman J. J. te Riele, Tadej Kotnik

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11792086

zbMATH Keywords

upper boundlower boundMertens conjecturePintz explicit upper bound

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Analytic computations (11Y35)

Related Items (7)

Improved sphere packing lower bounds from Hurwitz lattices ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Selected Applications of LLL in Number Theory ⋮ Biased behavior of weighted Mertens sums ⋮ Symmetric matrices related to the Mertens function ⋮ Linear relations of zeroes of the zeta-function ⋮ Improved results on the Mertens conjecture

This page was built for publication: Algorithmic Number Theory