An Arithmetical Formula for the Function π(x) to Count Exactly the Number of Primes if 25 ≤ x ≤ 1572 with Python Code to Test It v. 4.3
Version 36 2024-09-25, 14:20
Version 35 2023-10-05, 03:10
Version 34 2023-09-04, 13:56
Version 33 2023-08-30, 01:22
Version 32 2023-08-30, 01:20
Version 31 2023-08-10, 22:04
Version 30 2023-08-08, 23:50
Version 29 2023-08-08, 23:39
Version 28 2023-03-16, 07:15
Version 27 2023-02-21, 00:39
Version 26 2023-02-20, 04:38
Version 25 2022-06-16, 00:28
Version 24 2022-02-12, 02:46
Version 23 2022-02-11, 16:41
Version 22 2022-02-03, 07:26
Version 21 2022-02-03, 07:25
Version 20 2022-02-01, 23:45
Version 19 2022-02-01, 04:30
Version 18 2022-02-01, 01:23
Version 17 2022-01-31, 00:23
preprint
posted on 2024-09-25, 14:20 authored by Danilo ChavezDanilo ChavezThis paper shows a very elementary way to count the number of primes, not exceeding a given number, with complete precision. It is the function π(x) if 25 ≤ x ≤ 1572 with x ∈ R. We plot the step function it generates. There is a program, at the end, to show you that it really works.
History
Usage metrics
Categories
Keywords
primenumbermathematicselementarypicountingtheorycompositetheoremDaniloChavezprimespi(x)pi(N)pi(n)danilochavezronaldintervalformulafunctionRonaldprime counting functionprime counting formulaNumerical and Computational Mathematics not elsewhere classifiedCombinatorics and Discrete Mathematics (excl. Physical Combinatorics)Applied Mathematics not elsewhere classifiedAlgebra and Number TheoryPure Mathematics not elsewhere classifiedarithmetical formulaarithmeticalarithmetical formula of prime counting functionarithmetical formula of pi(x)Prime Counting Functionnumber theory
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC