• Home
  • Search
  • Computing 𝜋(𝑁): An elementary approach in 𝑂̃(√𝑁) time
  • https://doi.org/10.1090/mcom/4039Copy DOI Icon

Computing 𝜋(𝑁): An elementary approach in 𝑂̃(√𝑁) time

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

We present an efficient and elementary algorithm for computing the number of primes up to N N in O ~ ( N ) \tilde {O}(\sqrt N) time, improving upon the existing combinatorial methods that require O ~ ( N 2 / 3 ) \tilde {O}(N ^{2/3}) time. Our method has a similar time complexity to the analytic approach to prime counting, while avoiding complex analysis and the use of arbitrary precision complex numbers. We apply our techniques to improve the state-of-the-art complexity of elementary algorithms for computing other number-theoretic functions, such as the Mertens function (in O ~ ( N ) \tilde {O}(\sqrt N) time compared to the known O ~ ( N 3 / 5 ) \tilde {O}(N^{3/5}) ), summing Euler’s totient function, counting square-free numbers and summing primes. Implementation code is provided.

Similar Papers
  • PDF
  • Research Article

Some Pythagorean type equations concerning arithmetic functions

  • Mar 18, 2021
  • Teaching Mathematics and Computer Science
  • Ildikó Kézér
  • Book Chapter
  • Citations1

The Ring of Fibonacci (Fibonacci “Numbers” with Matrix Subscript)

  • Jan 01, 1991
  • Odoardo Brugia +2
  • Research Article
  • Citations2

An arithmetical equation with respect to regular convolutions

  • Mar 07, 2017
  • Aequationes mathematicae
  • Pentti Haukkanen
  • Research Article
  • Citations6

On the equiconvergence of expansions by Riesz bases formed by eigenfunctions of a linear differential operator of order2n

  • Sep 01, 1984
  • Acta Mathematica Hungarica
  • V Komornik
  • Research Article
  • Citations3

Spectral properties of operators in linear transport theory

  • Sep 01, 1979
  • Integral Equations and Operator Theory
  • Gerrit Lekkerkerker
  • Research Article
  • Citations11

Some Compact Generalizations of Bernstein-type Inequalities for Polynomials

  • Jan 01, 2004
  • Mathematical Inequalities & Applications
  • Abdul Aziz +1
  • Research Article

On the mean modulus of trigonometric polynomials and a conjecture of S. Chowla

  • Jan 01, 1972
  • Proceedings of the American Mathematical Society
  • J Chidambaraswamy
  • PDF
  • Research Article
  • Citations5

Clausen’s Series 3F2(1) with Integral Parameter Differences

  • Sep 25, 2021
  • Symmetry
  • Kwang-Wu Chen
  • Research Article
  • Citations2

Classical orthogonal polynomials via a second-order linear differential operators

  • Jun 01, 2020
  • Indian Journal of Pure and Applied Mathematics
  • Baghdadi Aloui +1
  • Research Article
  • Citations66

On integrating the techniques of direct methods with anomalous dispersion. I. The theoretical basis

  • Sep 01, 1982
  • Acta Crystallographica Section A
  • H Hauptman
  • Research Article
  • Citations7

On Borel‐type methods of summability

  • Dec 01, 1958
  • Mathematika
  • David Borwein
  • Research Article
  • Citations32

Radiation impedance matrices for rectangular interfaces within rigid baffles: Calculation methodology and applications

  • Feb 01, 2002
  • The Journal of the Acoustical Society of America
  • Allan D Pierce +2
  • Research Article
  • Citations3

Tauberian Theorems for Borel-Type Methods of Summability

  • Jun 01, 1974
  • Canadian Mathematical Bulletin
  • David Borwein +1
  • Research Article
  • Citations4

An extension of the Lehmers’ picturesque exponential sums

  • Jan 01, 1993
  • Mathematics of Computation
  • Tom M Apostol
  • Research Article

Domain of meromorphy of a class of Bateman-like totient zeta functions

  • Nov 20, 2019
  • Journal of Number Theory
  • Driss Essouabri +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.