If you thought all those agonizing hours you spent during mathematics classes wouldn’t take you anywhere then you were probably wrong. It is time to flex your brain cells because there is a mathematics challenge that can make you a millionaire. All you have to do is solve any one of the seven mathematics problems presented in the challenge.

Now a lot of questions might be rising in your mind such as, ‘who is crazy enough to spare a million dollars for a math problem?’ Well, these seven math problems are a part of the Millennium Prize Problems challenge which was started by the Clay Mathematics Institute of Cambridge Massachusetts (CMI). This challenge was established at the turn of the millennium to celebrate the blessing of mathematics.

The seven problems in the challenge have left many great mathematicians scratching their heads over the years. So CMI decided to throw an open challenge to any genius minds out there in the world to come up with the solution of these problems and in return take back home the hefty prize of one million dollars.

You might think that these problems must be impossible to solve because of the extent of the challenge. But you would be wrong because one of these seven problems has been solved by a Russian mathematician named Grigori Perelman. He solved the Poincare Conjecture problem that some of the greatest minds in mathematics field had grappled with since 1904. Perelman solved the problem back in 2002 and he also refused the gigantic prize money of a million dollars. Shockingly, he also refused to receive the highest honor of the mathematics world, the Fields Medal.

Below are the remaining six unsolved problems that can make you a millionaire if you manage to solve them:

## P vs. NP

P vs NP is known for giving sleepless nights to many computer scientists in the world. This problem has become a sort of mythical unicorn that every mathematician wants to search for. In the term P vs NP, P stands for polynomial and NP stands for the nondeterministic polynomial. In simple words, P are the problems which a computer can solve easily and NP are the problems that a computer is able to understand but not solve.

So far computer testing has proved that P problems are also NP problems. But the main question that no has been able to answer theoretically is that, are both P and NP the same type of problems?

## Riemann Hypothesis

The Riemann hypothesis has baffled mathematicians for more than a century. This problem was created by Bernhard Riemann who was a German Mathematician from the 19th century. He presented this hypothesis in his paper which was published back in 1859. This hypothesis states that all of zeta function’s ‘non-obvious’ zeros are complex numbers with a ½ real part.

No mathematician has been able to prove this hypothesis for nearly 150 years. If you think you can take it on then go ahead for a million dollars’ sake.

## Yang-Mills and Mass Gap

Yang-Mills and Mass Gap problem is a problem that describes elementary particles using geometrical structures. This problem is so difficult that many mathematicians gave and called it unsolvable.

## Navier-Stokes Equation

If you have ever been on an airplane then you most likely experienced turbulence from the headwind. Many physicists believe that all the turbulence and pattern of following waves can be easily predicted. The method of the prediction lies in the Navier-Stokes equation.

Navier-Stokes equation was a result of works of Claude-Louis Navier (a French physicist) and George Gabriel Stokes (an Irish physicist).  So far no one has been able to understand this equation let alone solve it. So if you think you are the one to conquer it then step forward and claim your prize.

## Hodge Conjecture

Hodge Conjecture is a mathematical problem that was presented by a British mathematician named Sir William Vallance Douglas Hodge. This problem suggests that for projective algebraic varieties there are pieces called Hodge cycles which are rationally linear combinations of algebraic cycles.

## Birch and Swinnerton-Dyer Conjecture

The Birch and Swinnerton-Dyer Conjecture suggests that any size of a rational points group is related to the points near s=1 for an associated zeta function. This problem further suggests that if ζ(1) = 0 then the rational points will be infinite. And if ζ(1) ≠ 0 then the rational points will just be finite.

Not one mathematician has come close to solving these mind-boggling equations. It might be your chance to shine so give it a try if you think you’ve got what it takes.