Advances in Pure Mathematics

Volume 12, Issue 3 (March 2022)

ISSN Print: 2160-0368   ISSN Online: 2160-0384

Google-based Impact Factor: 0.50  Citations  h5-index & Ranking

The Computing Formula of Number of Primes No More than Any Given Positive Integer

HTML  XML Download Download as PDF (Size: 400KB)  PP. 229-247  
DOI: 10.4236/apm.2022.123018    193 Downloads   1,614 Views  

ABSTRACT

In this paper, we give out the formula of number of primes no more than any given n (n Z+, n > 2). At the same time, we also show the principle, derivation process of the formula and application examples, it is usually marked with π(n), which is: that is:
where “[ ]” denotes taking integer. r = 1,2,3,4,5,6; sx = s1,s2,...,sj,sh; s1,s2,...,sj,,sh = 0,1,2,3,....As i ≥ 2, 2 sx i-1 (x=1,2,...,j,h).

Share and Cite:

Wang, M. , He, Z. and Wang, M. (2022) The Computing Formula of Number of Primes No More than Any Given Positive Integer. Advances in Pure Mathematics, 12, 229-247. doi: 10.4236/apm.2022.123018.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.