International Journal of Mathematics Trends and Technology
Volume 69 | Issue 3 | Year 2023 | Article Id. IJMTT-V69I3P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V69I3P508
| Received | Revised | Accepted | Published |
|---|---|---|---|
| 10 Feb 2023 | 09 Mar 2023 | 22 Mar 2023 | 31 Mar 2023 |
The work in this document advances concepts and procedures that bridge the gap between the prime enumeration and the zeta zero location in three main segments. The first segment is based on the Egyptian enumeration system which is used in this work to design the Construction and Detachment Principle, with the goal of establishing an extension field where the zeta zero location resides side-by-side with the integer under study. In the absence of a reliable formulae, a limit point can be established using a set of heuristics from the Golden Ratio and the Egyptian Continuous Fraction Algorithm. The latter formed the genus of a method that identified a unique zeta zero for a given x value. This is done in accordance with Dimension.al Analysis to test the validity of the zeta zero location distribution with respect to the prime distribution. The second segment establishes two formulas to test the relevancies of the zeta location with respect to the volume of the knapsack boxes containing prime numbers up to a given x value. This document also provides a method to test whether the formula produces an accurate counting of the prime for the given value of x by using the Taylor Approximation Polynomial at the slope point. This slope is the closest point to where the zeta zero resides. In the third segment of the work, the results will show the distribution of the zeta zero’s location and, in doing so, lessen the need of finding the largest gap between prime numbers. Finally, Complex analysis as well as modal logic are explored to establish the parameters of a dynamic algorithm for the general solution of the π(x) conjecture.
[1] Alan Ross Anderson, Nuel D. Belnap, and J. Michael Dunn, Entailment, Vol II: The Logic of Relevance and Necessity, Princeton University Press, Reprint edition, 2017.
[Google Scholar] [Publisher Link]
[2] John C. Amazigo, and Lester A. Rubenfeld, Advanced Calculus And Its Applications to the Engineering And Physical Sciences, Wiley, 1st Edition, 1980.
[Google Scholar] [Publisher Link]
[3] Thomas Becker, and Volker Weispfenning, A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics (GTM, volume 141), Springer, 1993.
[Google Scholar] [Publisher Link]
[4] Samuel R. Buss, Bounded Arithmetic, University of California, Berkley, 1985.
[Google Scholar]
[5] Folkmar Bornemann, “PRIMES Is in P: Breakthrough for “Everyman”,” Notices of the American Mathematical Society, vol. 50, no. 5, pp. 545-552, 2003.
[Google Scholar]
[6] Harvey Cohn, Advanced Number Theory, Dover Publications, 1980.
[7] John Derbyshire, Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, Joseph Henry Press, 2003.
[Google Scholar]
[8] A. Evyatar, and P. Rosenbloom, Motivated Mathematics, Cambridge University Press, 1981.
[Publisher Link]
[9] Donald E. Knuth, The Art of Computer Programming, Vol 1: Fundamental Algorithms, 2nd Edition, Addison-Wesley, 1973.
[10] Jean Louis Lassez, and Gordon Plotkin, Computational Logic Essays in Honor of Alan Robinson, The MIT Press, 1991.
[Google Scholar] [Publisher Link]
[11] Harry R. Lewis, and Christos H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, 2nd edition, 1997.
[Google Scholar]
[12] Melvin J. Maron, and Robert J. Lopez, Numerical Analysis: A Practical Approach, International Thomson Publishing, 1991.
[13] Piergiorgio Odifreddi, Logic and Computer Science (Apic Studies in Data Processing), Academic Press, 1st edition, 1990.
[14] Charles Stanley Ogilvy, and John Timothy Anderson, Excursions in Number Theory, Oxford University Press, 1988.
[Google Scholar]
[15] Oystein Ore, Number Theory and Its History, Dover Publications, 1988.
[Google Scholar]
[16] George Pólya, and John H. Conway, How to Solve It: A New Aspect of Mathematical Method, Princeton University Press, Reprint Edition, 2014.
[Publisher Link]
[17] Vera Pless, Introduction to the Theory of Error-Correcting Codes, Third Edition, Wiley-Interscience, 1998.
[Google Scholar] [Publisher Link]
[18] Gerald E. Sacks, Higher Recursion Theory, Perspective in Logic, vol. 2, Association for Symbolic Logic, 1990.
[19] William M. Trench, Advanced Calculus, Harper & Row, 1978.
[20] Raymond Turner, Truth and Modality for Knowledge Representation (Artificial Intelligence), The MIT Press, 1991.
[Google Scholar]
[21] Lincoln A. Wallen, Automated Deduction in Non-Classical Logic, The MIT Press, 1989.
[Publisher Link]
[22] Albert Wilansky, Topology for Analysis, Dover Publications, Illustrated edition, 2008.
[Google Scholar]
[23] Wilson M. Zaring, An Introduction to Analysis, The Macmillan Company, 1967.
[24] Dennis G. Zill, A First Course in Differential Equations with Modeling Applications, 10th edition, Cengage Learning, 2012.
[Google Scholar]
Frantz Olivier, "The Riemann Hypothesis : The Vision and How We Proceed," International Journal of Mathematics Trends and Technology (IJMTT), vol. 69, no. 3, pp. 58-72, 2023. Crossref, https://doi.org/10.14445/22315373/IJMTT-V69I3P508
PDF 
Abstract 
Keywords 
References 
Citation