Article
Version 1
Preserved in Portico This version is not peer-reviewed
Bounds on the sum of (log(p))2 Terms
Version 1
: Received: 8 July 2021 / Approved: 9 July 2021 / Online: 9 July 2021 (13:17:02 CEST)
How to cite: Feliksiak, J. Bounds on the sum of (log(p))2 Terms. Preprints 2021, 2021070221. https://doi.org/10.20944/preprints202107.0221.v1 Feliksiak, J. Bounds on the sum of (log(p))2 Terms. Preprints 2021, 2021070221. https://doi.org/10.20944/preprints202107.0221.v1
Abstract
In this research paper, we implement the theory of the primorial function, to develop the Supremum and Infimum bounds for the sum of (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 considered sufficiently accurate, while facilitating an easy and fast computation of the estimate of the sum.
Keywords
Infimum of the sum of log p terms squared; Supremum of the sum of log p terms squared; Lower and Upper bounds on the sum of log p terms squared
Subject
Computer Science and Mathematics, Algebra and Number Theory
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment