![]() ![]() There have been numerous people who have tried their hand at this, and all have failed. It is currently the largest open problem in theoretical computer science. ![]() Got all that? Basically it’s solving the exact same problem twice, except the numbers keep changing. ![]() NP is the bastard cigar shaped oval that tries to get one of its ends to match perfectly over the said circle, with positive outcomes of those same problems, but that have to be verified in a math process called Polynomial Time, which is pretty much how they can stay the same through moving time. To put it in simple terms, P is a group of problems that equal, say, the size of a circle. One such problem is solving P= NP, a conundrum first proposed in 1971. So as long as you don’t mind losing your mind while doing so, there are still six problems out there for you to solve. However, he spent so many years on the problem, he pretty much dropped out of society, refusing a Fields Medal (math’s highest honor,) and never claimed his million bucks, citing his disillusionment with mathematics. Grigori Perelman, a Russian mathematician who lived in his mom’s basement, solved Poincare’s Conjecture, an unsolved problem since 1904. In the year 2000, the Cray Mathematical Institute brought out a list of math’s seven most infamous problems, with the person who solves each problem getting a million dollars. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |