Submitted:
16 February 2024
Posted:
20 February 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Analysis of with Prime Counting Function
2.1. Proof of Zeros at Prime Numbers
- We initially note that since the prime counting function enumerates the quantity of primes less than or equal to n.
- Consequently, the argument of the secant function transforms into .
- The argument does not inherently constitute an integer multiple of when k assumes a prime value.
- However, as k escalates to larger prime numbers, approximates an integer multiple of .
- With increasing values of k, the term progressively aligns with an integer multiple of , consequently compelling the secant function towards zero.
- Hence, for substantial prime numbers k, the expression tends towards zero.
3. Reiman Hypothesis
- The prime counting function, , which represents the total number of primes less than or equal to n, grows approximately logarithmically with n.
- Multiplication by the constant does not alter the growth rate.
- The secant function, , is bounded between and 1 for real x.
- The natural logarithm function, , increases slowly as x grows larger.
- The imaginary component of any complex number is finite.
4. Findings and Discussion
5. Conclusion
References
- EM Bertrand. Icg publications [formerly cgeb]: 2008–present. Appl. Environ Microbiol, 88(6):e0214621, 2022.
- Bernhard Riemann. On the number of prime numbers less than a given quantity (ueber die anzahl der primzahlen unter einer gegebenen grösse). Monatsberichte der Berliner Akademie, 1859.
- Bernhard Riemann. Ueber die anzahl der primzahlen unter einer gegebenen grosse. Ges. Math. Werke und Wissenschaftlicher Nachlaß, 2(145-155):2, 1859.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).