Rock, Marry, Kill: Millennium Problems Edition - Riemann, Navier-Stokes, P versus NP

Rock, marry, kill, millennium problems edition. Riemann hypothesis, Navier-Stokes equations, and P versus NP. They all have a $1 million prize for a solution, but which one do you rock, marry, and which one are you going to kill? Here is the right answer. The Riemann hypothesis has been around the longest, so it's maybe a little on the old side, but it does have the prestige. All of the big-name mathematicians have tried to solve it, and it is the most famous. Plus, it's all about prime numbers, and we mathematicians do love prime numbers. The Navier-Stokes equations, an obvious favorite of mine, being the subject of my PhD, and also being tattooed here on my rib cage. It's about fluid flow, which is pretty, and it is also astonishingly difficult. It has that hard-to-get appeal. P versus NP, a favorite of computer scientists, as it looks at how quickly computers can solve problems, which does mean a solution has the potential to fundamentally change the modern world. Also, probably the easiest one to understand, not sure if that's good or bad. So, for me, it has to be Navier-Stokes for marriage. Four years in with the PhD, I'm still coming back for more. It's got that longevity. And I think Riemann gets rocked. It may be old, but it's on upper tier level when it comes to fame and prestige. That is a story you will be dining out on for the rest of your life. Which leaves P versus NP as the one to kill. Sorry, computer scientists. So, now you know the right answer, what would you do?