Downloads provided by UsageCounts
This paper presents an exploration of prime numbers in mathematics from the 18th century until the present. It begins by discussing the contributions of Leonard Euler and Carl Friedrich Gauss in the 18th and 19th centuries. Then, the development of the prime number theorem, the Riemann hypothesis, the Hardy-Littlewood circle method, and the Selberg zeta function is described. For the 20th century, the work of G.H. Hardy and J.E. Littlewood on prime numbers, the Riemann hypothesis, and the Goldbach conjecture is discussed. Finally, the paper presents recent developments in the field, including the use of computers to find and verify vast prime numbers and to prove various conjectures and theorems related to prime numbers. This paper describes prime numbers' history and importance in mathematics. The insights from this paper offer a conceptual view for understanding the remarkable contributions that several scholars have made over the years to expand knowledge about prime numbers in mathematics.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 10 | |
| downloads | 12 |

Views provided by UsageCounts
Downloads provided by UsageCounts