Search

In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy-Ramanujan Theorem. We also provide a theoretical argument explaining the experimental observations of Yang-Hui He about the learnability of primes, and posit that the Erd\H{o}s-Kac law would very unlikely be discovered by current machine learning techniques. Numerical experiments that we perform corroborate our theoretical findings., Comment: 10 pages; parts of arXiv:2308.10817 reworked and amended; author's draft; accepted in PLOS ONE

Number Theory has a very long history that dates back thousands of years. The main goal of this study is to understand properties of numbers which essentially can be reduced to understanding prime numbers. Although we have the outstanding Prime Number Theorem, more precise information about the distribution of prime numbers is mostly unknown. For example, it is also not known if there are infinitely many pairs of prime numbers having difference 2, the so-called twin prime pairs. Recent breakthroughs in Analytic Number Theory have succeeded in showing the infinitude of prime pairs with small gaps, which is the contribution of Yitang Zhang, one of this year's Fields medalists, James Maynard, and also Terrence Tao. The 280-year-old Goldbach's conjecture and the Riemann hypothesis which is now over 160 years old are also among the most famous yet important unsolved problems in Analytic Number Theory. The Riemann Hypothesis is a conjecture about the location of zeros of the Riemann zeta function. The importance of this problem not only in Number Theory but also many other areas of Mathematics and even Physics is reflected in many known equivalent statements. In Analytic Number Theory alone, we know the equivalence between the Riemann Hypothesis and many prime distribution related problems. Its equivalence to Goldbach related problems is also known. It is important to note that Goldbach's conjecture itself is an independent problem to the Riemann Hypothesis and neither is stronger than the other. In this talk, I would like to introduce a few interesting recent results in this direction.

In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory., Comment: There is an error in this paper that is addressed in arXiv:2308.10817

In this article, we mainly see several recent results on twin prime conjecture since the works of Goldston, Pintz and Yıldırım (GPY). Among others we focus on the GPY sieve, Zhang's breakthrough and the Maynard-Tao method. We briey describe the outlines of these new methods.