Back to another Millennium Prize problem! There are two types of questions: one, where an algorithm can solve the question in polynomial time (P), and ones, where there is no way to find the answer quickly, but if information is given on showing what the answer is, it can be quickly verified, which is NP, … Continue reading P/NP?

# Tag: Clay Institute

# Poincaré Conjecture… with less detail.

Yes, this was already solved by Grigory Perelman, but I have nothing much, so... Imagine a spherical item. And, for the easiest solution, let's use an apple. Wrap the rubber band around the apple. Without tearing it or letting it leave the surface, we can slowly shrink the rubber band until it becomes a single … Continue reading Poincaré Conjecture… with less detail.

# Riemann Hypothesis

Yesterday, I said that I would do a post on the Riemann Hypothesis, so here we are now. There is a function with the name of the Riemann Zeta Function, named after Bernhard Riemann. The Riemann Hypothesis states that the Riemann zeta function has zeroes only at the negative even integers and complex numbers with … Continue reading Riemann Hypothesis

# P=NP is a part of … Millennia!

How many Math questions are there? Obviously, there's infinitely many. But how many problems can be solved quickly? A LOT! What about having the answer verified? MILLIONS OF BILLIONS! The P=NP question ask whether a question that can be verified quickly (P) can also be solved quickly (NP). Can you solve this? Hello. The Millennium … Continue reading P=NP is a part of … Millennia!