zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The Mertens conjecture revisited. (English) Zbl 1143.11345
Hess, Florian (ed.) et al., Algorithmic number theory. 7th international symposium, ANTS-VII, Berlin, Germany, July 23–28, 2006. Proceedings. Berlin: Springer (ISBN 3-540-36075-1/pbk). Lecture Notes in Computer Science 4076, 156-167 (2006).
Summary: Let M(x)= 1nx μ(n) where μ(n) is the Möbius function. The Mertens conjecture that |M(x)|/x<1 for all x>1 was disproved by A. M. Odlyzko and H. J. J. te Riele [J. Reine Angew. Math. 357, 138–160 (1985; Zbl 0544.10047)]. In the present paper, the known lower bound 1.06 for lim supM(x)/x is raised to 1.218, and the known upper bound -1·009 for lim infM(x)/x is lowered to -1·229. In addition, the explicit upper bound of J. Pintz [An effective disproof of the Mertens conjecture. Astérisque, 147–148, 325–333 (1987; Zbl 0623.10031)] on the smallest number for which the Mertens conjecture is false, is reduced from exp(3·21×10 64 ) to exp(1·59×10 40 ). Finally, new numerical evidence is presented for the conjecture that M(x)/x=Ω ± (logloglogx).
11N37Asymptotic results on arithmetic functions
11Y35Analytic computations