Abstract
This research explores the distribution of prime numbers, which are a fundamental topic in number theory. The study originated from the author's fascination with mathematics and the desire to discover something novel. The research proposes that the distribution of prime numbers follows a regular pattern starting from the number 2. The author suggests that prime numbers can be obtained by dividing certain even numbers that have four factors by the number 2, resulting in prime numbers in sequential order. This hypothesis was tested and confirmed through the practical application of the proposed mathematical formula. Additionally, the study found that even numbers greater than or equal to 8, with six or more factors, produce complex numbers. Thus, this research provides two main contributions: firstly, a mathematical formula for the distribution of prime numbers, and secondly, a formula for the distribution of complex numbers. These findings have potential applications in various mathematical fields, including cryptography and problem-solving in number theory.
References
Granville A. Prime numbers and the Riemann hypothesis. Cambridge University Press 2019.
Conrey JB. The Riemann Hypothesis. Notices of the AMS 2003; 50(3): 341-353.
Hardy GH, Wright EM. An introduction to the theory of numbers. Oxford University Press 2008. https://doi.org/10.1093/oso/9780199219858.001.0001
Tao T. An introduction to the prime number theorem. Princeton University Press 2016.
Zhang Y. Bounded gaps between primes. Annals of Mathematics 2014; 179(3): 1121-1174. https://doi.org/10.4007/annals.2014.179.3.7
Bombieri E. Problems of the Millennium: The Riemann Hypothesis. Clay Mathematics Institute 2007.
Hildebrand A. On the number of prime numbers in short intervals. Mathematical Proceedings of the Cambridge Philosophical Society 1987; 101(1): 25-27.
Ingham AE. The distribution of prime numbers. Cambridge University Press 1990.
Baker RC, Harman G, Pintz J. The difference between consecutive primes, II. Proceedings of the London Mathematical Society 2001; 83(3): 532-562. https://doi.org/10.1112/plms/83.3.532
Selberg A. An elementary proof of the prime number theorem. Annals of Mathematics 1949; 50(2): 305-313. https://doi.org/10.2307/1969455
Montgomery HL, Vaughan RC. The large sieve. Mathematika 1974; 20(2): 119-134. https://doi.org/10.1112/S0025579300004708
Heath-Brown DR. Prime number theory. Clarendon Press 1988.
Gowers T. Primes and their distribution. The Princeton Companion to Mathematics 2009. https://doi.org/10.1515/9781400830398
Green B, Tao T. The primes contain arbitrarily long arithmetic progressions. Annals of Mathematics 2008; 167(2): 481-547. https://doi.org/10.4007/annals.2008.167.481
Maier H. Primes in short intervals. Michigan Mathematical Journal 1985; 32(2): 221-225. https://doi.org/10.1307/mmj/1029003189
Goldston DA, Pintz J, Yıldırım CY. Primes in tuples I. Annals of Mathematics 2009; 170(2): 819-862. https://doi.org/10.4007/annals.2009.170.819
Maynard J. Small gaps between primes. Annals of Mathematics 2015; 181(1): 383-413. https://doi.org/10.4007/annals.2015.181.1.7
Soundararajan K. Small gaps between prime numbers: the work of Goldston-Pintz-Yıldırım. Bulletin of the American Mathematical Society 2010; 47(1): 1-18. https://doi.org/10.1090/S0273-0979-06-01142-6
Vaughan RC. The Hardy-Littlewood method. Cambridge University Press 1997. https://doi.org/10.1017/CBO9780511470929
Tenenbaum G. Introduction to analytic and probabilistic number theory. American Mathematical Society 2015. https://doi.org/10.1090/gsm/163
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.