Preprint
Article

Bounds on the sum of (log(p))2 Terms

This version is not peer-reviewed.

Submitted:

08 July 2021

Posted:

09 July 2021

You are already at the latest version

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 open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Altmetrics

Downloads

317

Views

285

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated