Ye Olde Blah

Did you know that there are seven problems whose solution is worth $1,000,000 USD each? Apparently some of these problems have been unsolved for quite some time, so they "might" be pretty difficult to solve.

P versus NP (http://en.wikipedia.org/wiki/Complexity_classes_P_and_NP)
The hodge conjecture (http://en.wikipedia.org/wiki/Hodge_conjecture)
The Poincare conjecture (http://en.wikipedia.org/wiki/Poincar%E9_conjecture)
The Riemman Hypothesis (http://en.wikipedia.org/wiki/Riemann_hypothesis)
YangMills existence and mass gap (http://en.wikipedia.org/w/index.php?title=Yang-Mills_Existence_and_Mass_Gap&action=edit)
Navier Stokes existence and smoothness (http://en.wikipedia.org/wiki/Navier-Stokes_equations)
The Byer and Swinnerton-Dyer conjecture (http://en.wikipedia.org/wiki/Birch_and_Swinnerton-Dyer_conjecture)

Of all these i'm only familiar with the first one, P versus NP, as should all Computer Science majors. I find it to be a particularly nice problem since finding a polynomial time algorithm solving the Clique Problem (http://en.wikipedia.org/wiki/K-clique_problem) is enough to show P=NP granting a profit of the sum above mentioned. If, after you've tried really hard to find a polynomial-time solution to the Clique Problem, you come to think that it's not possible, then proving why it's not possible will show P<>NP, granting again the quoted sum. There's no losing with this :) (unless of course PxNP is an undecidable problem, but i choose to ignore that possibility :) )

Does it have to be solvable under the classical computing model?

I suppose.

Whoa... I didnt really understand what the hell any of those things are meant to be except the first one...

Guess I wont be getting any millions anytime soon.

Maybe "easy" was the wrong adjective to use :P

Give me an English or music-based puzzle and I might be in with a chance. Maths and computing can go take a running jump though - I'm not down with all that shiznit, foo'.