Hardest Math Problem Ever Solved

Hardest Math Problem Ever Solved-3
The reality is that, as we continue to calculate larger and larger numbers, we may eventually find one that isn't the sum of two primes...

Inspired by Thompson's list, we've come up with our own list of deceptively simple maths problems to frustrate (and hopefully inspire) you.The Poincare conjecture was solved by Grigori Perelman. So hard, in fact, that there's literally a whole Wikipedia page dedicated to unsolved mathematical problems, despite some of the greatest minds in the world working on them around the clock.This is why college classes at top-tier universities have tests on which nearly no one clears 70%, much less gets a perfect score.They’re training future researchers, and the whole point of research is to find and answer questions that have never been solved.The problems are the Birch and Swinnerton-Dyer conjecture, Hodge conjecture, Navier–Stokes existence and smoothness, P versus NP problem, Poincaré conjecture, Riemann hypothesis, and Yang–Mills existence and mass gap.Only one of these problems has been solved and it is the Poincaré conjecture, which states that if every loop in a three dimensional manifold can be shrunk to a point, then the manifold can be deformed into a three-dimensional sphere.According to the inscribed square hypothesis, inside that loop, you should be able to draw a square that has all four corners touching the loop, just like in the diagram above. but mathematically speaking, there are a whole lot of possible loop shapes out there - and it's currently impossible to say whether a square will be able to touch all of them."This has already been solved for a number of other shapes, such as triangles and rectangles," writes Thompson, "But squares are tricky, and so far a formal proof has eluded mathematicians."Goldbach's conjecture Similar to the Twin Prime conjecture, Goldbach's conjecture is another seemingly simple question about primes and is famous for how deceptively easy it is.The question here is: is every even number greater than 2 the sum of two primes?But is there an infinite amount of prime numbers pairs that differ by two, like 41 and 43?As primes get larger and larger, these twin primes are harder to find, but in theory, they should be infinite...

SHOW COMMENTS

Comments Hardest Math Problem Ever Solved

The Latest from imgworld.ru ©