Some open problems involving Prime numbers

-
Prime numbers are the most fascinating to mathematicians. Understandably so, as they are the basic atoms which uniquely constitute each number (Fundamental Theorem of Arithmetic) and also have very important applications in cryptography which is largely responsible for our internet security.  Over the centuries, we have learned a lot about them, yet there is an abundance of problems we still cannot prove. In this article, we will highlight a few of them.

Goldbach’s conjecture



Every even integer greater than 2 can be expressed as the sum of two prime numbers.

E.g. 34=3+31

But is it always true?

Legendre’s conjecture, proposed by Adrien-Marie Legendre, states that there is a prime number between n2 and (n+1)2 for every positive integer n. For example, between 4 and 9 which are square of 2 and 3, we have 5 and 7 as prime numbers.  The conjecture is one of Landau’s problems (1912) on prime numbers; as of 2020, the conjecture has neither been proved nor disproved.

Twin primes conjecture states that here are infinitely prime numbers that differ by just 2.

For example, 3 and 5, 11 and 13,137 and 139.

But, so far, there has been no proof that it holds in all cases.

The other aspect of prime numbers that fascinates mathematicians is the occurrence and distribution of prime numbers. Mathematicians believe that despite the apparent randomness of prime numbers, there is some undiscovered higher order of rules which govern them.  Initially, they occur frequently but as we go further along they become sparser. Below we show the first 1,000 prime numbers


 In fact, many attempts have been made to generate prime numbers. The following was suggested by Euler in the 18th century. 

Euler’s prime–generating polynomial

n=1 gives 41 (prime)
n=2, gives 43 (prime)
n=3, gives 47 (prime), etc.
Fails for the first time when n=40.

Among the most celebrated results in number theory is the Prime number theorem. The number of primes less than any given number N is roughly


The estimate gets closer and closer to the actual numbers of primes for larger and larger values of N. This does not tell us where the next prime number lies but does tell us how many primes are in a given number interval provided the interval is large enough.

However, the most publicized and important unsolved problem in all of mathematics is the Riemann hypothesis.


§  concerns the distribution of prime numbers

Please read my blog article on Riemann hypothesis for more details.

In conclusion, we still have a long way to go or if ever to truly understand prime numbers. Some of the unproven problems are tantalizing easy to state and understand yet notoriously difficult to prove. If you are willing to put in the work to prove any one of them and are able to do so successfully, I assure you of instant mathematical stardom and celebrity!

Comments

Post a Comment

Popular posts from this blog

The Famous Basel Problem: The process that led Euler to the answer!

-
Image
Euler is considered to be one of the greatest mathematician of the 18 th century and many believe that he was among the greatest of all time. The answer to the Basel problem is considered to be among his many gems. It is the sum of the series shown below and the answer is astounding! What is π doing there? Mathematician at the time summed up the series to the first 10, 100, and 1000 terms and the slow rate of convergence gave very little clue to what the answer could be.  Euler realized that he would have to find a function that would converge much faster. After some trial and error he found the function shown below whose power series expansion is shown.   So if we integrate the above expression from 0 to 1 This is what he was looking for! To evaluate the integral in the left, he broke it into two parts. Then he evaluated each of the integrals in turn. Then the next integral Put x=1-t When x=1/2, t=1/2 When x=1, t=0
Read more

Millennium Problem: Riemann Hypothesis

-
Image
A prime number is a number that is divisible only by itself and 1. Some examples being  2, 3, 5, 7, 9, 11, 13.…   The great mathematician Euclid proved centuries ago that there are an infinite number of them continuing without pattern ad infinitum. However, their real importance is given by what is known as the Fundamental Theorem of Arithmetic. It states that every number can be uniquely expressed as a product of prime numbers. Let’s take the example of 364 = 2 × 2 × 7 × 13. This is the only way that 364 can be obtained by prime numbers! Therefore, they are the atoms or building blocks of numbers. But in 1859, the great German mathematician Bernhard Riemann hypothesized that the spacing of the primes logically follows from other numbers, now known as the “nontrivial zeros” of the Riemann zeta function. The Riemann zeta function takes inputs not only real numbers but also  complex numbers — meaning they have both “real” and “imaginary” components — and yields other numbers
Read more

How to make a cool million Dollars by solving a math problem?

-
Image
The Millennium Prize Problems are seven problems in mathematics that were stated by the Clay Mathematics Institute in 2000. As of June 2020, six of the problems remain unsolved. A correct solution to any of the problems results in a US $1,000,000 prize sometimes called a Millennium Prize being awarded by the institute.  Solved Problem: -  Poincare conjecture. When the Clay institute first announced these seven problems, it was generally perceived by the mathematics community that these seven problems would remain unsolved for the foreseeable future. To their surprise, Grigori Perelman a recluse Russian mathematician solved the Poincare conjecture and in July 2010 he famously declined the 1 million dollar prize!   Furthermore, in August 2006, he declined the Fields medal which is considered even more prestigious than the Nobel Prize as it is given every four years to a mathematician under the age of 40. The Nobel Prize is given every year with no age limit. In a seri
Read more