Fonction sommatoire de la fonction de Möbius 1. Majorations expérimentales
- 1 January 1993
- journal article
- research article
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 2 (2) , 89-98
Abstract
On établit la majoration , valable pour x appartenant à I'intervalle [33,1012], et on decrit les algorithmes qui ont permis de I'obtenir. On étudie égalernent un algorithme de calcul de valeurs isoléesde M(x), donton montre que la cornplexité est en O(X 3/4 log1/2 x) pour Ie temps de calcul, et en O(X 1/2) pour I'encombrement mérnoire. We establish the upper bound valid for x in the interval [33, 1012], and we describe the algorithms used to obtain it. We also study an algorithm for the computation of isolated values of M(x), proving that its time and space complexities are O(X 3/4 log1/2 x) and O(X 1/2), respectively.Keywords
This publication has 7 references indexed in Scilit:
- Computing π(x): An analytic methodJournal of Algorithms, 1987
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- PATTERNS AND SEARCH STATISTICS**Research sponsored by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under Grant No. AFOSR 70-1915 and the National Science Foundation under Grant No. NSF-GK-4827. The United States Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copywright notation herein.1971
- An improved estimate for the summatory function of the Möbius functionActa Arithmetica, 1968
- Eine empirische Untersuchung zur Mertensschen FunktionNumerische Mathematik, 1963
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962
- Über eine besondere Art von Umkehrung der Reihen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1832