\(\text { Bounds on the Sum of } \sum(\log p)^2 \text { Terms }\)
Jan Feliksiak *
Language School in Krakw, Poland.
*Author to whom correspondence should be addressed.
Abstract
In this research paper we implement the theory of the primorial function, to develop the Supremum and Infimum bounds for the sum Σp≤n (log p)2. There are, however, considerable computational difficulties related to these bounds. Therefore, from a pragmatic point of view, a set of Upper and Lower bounds had been developed to bypass this issue. Despite the increased estimation error, the Upper and Lower bounds are still considerably accurate, while facilitating an easy and fast computation of the estimate of the sum.
How to Cite
Downloads
References
Feliksiak J. The distribution of primes in a short interval. ScienceOpen Preprints. 2021.
Friedlander J, Goldston D. Sums of three or more primes. Transactions of the American
Mathematical Society. 1997;349(1):287-310.
Kumchev AV. Exponential Sums Over Primes and Their Applications; 2007.
Available: https://www.yumpu.com/en/document/view/35439238/exponential-sums-over-
primes-and-their-applications
Law J. The circle method on the binary Goldbach conjecture;2005.
Available: http://web.math.princeton.edu/mathlab/jr02spring/goldbach/goldbach5.pdf
Feliksiak; AJPAM, 4(3): 426-436, 2022; Article no.AJPAM.1092
Ramachandra K. Srinivasa Ramanujan (The inventor of the circle method)(22-12-1887 to 26-
-1920). Hardy-Ramanujan Journal. 1987;10.
Feliksiak J. The Binary Goldbach Conjecture. ScienceOpen Preprints. 2021.
Feliksiak J. The elementary proof of the Riemann's hypothesis;2020.