\(\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.