What is the most perplexing and difficult unsolved math problem?

  • Thread starter ElliotSmith
  • Start date
In summary, the most perplexing and difficult unsolved math problem is difficult to determine as its difficulty is only known once it is solved. However, the Collatz conjecture, which is easy to understand but has yet to be solved, is a prominent example of a problem that is considered difficult. Other examples of unsolved problems include the Extended Riemannian Hypothesis and the continuum hypothesis, both of which have puzzled mathematicians for centuries. While it is impossible to say which problem will take 2000 years or longer to solve, there are still many open problems in mathematics that have yet to be answered.
  • #1
ElliotSmith
168
104
TL;DR Summary
What is the most perplexing and difficult unsolved math problem you can think of?
What is the most perplexing and difficult unsolved math problem that you can possibly think of?
 
Mathematics news on Phys.org
  • #3
We generally don't know how difficult a problem is until we solve it. We only set lower bounds on the difficulty. If many leading mathematicians can't solve it after years of work it's probably a hard problem.

The Collatz conjecture is a prominent example of a problem that looks simple but is very hard. You can explain the problem to a 5 year old - but despite many attempts we don't have a solution. Erdős said "Mathematics may not be ready for such problems."
 
  • #4
fresh_42 said:
ERH.
what is this?
 
  • #6
The ancient greeks wondered about geometric problems like whether it was possible to draw a square with the same area as a given circle, or whether it was possible to trisect an angle. Humanity didn't prove those to be impossible until the 1800s - it took over 2000 years to go from hypothesis to proof! Enormously important new fields of math were invented to solve these seemingly straightforward problems.

The most difficult unsolved math problem that we have right now is whichever one will take 2000 years to solve. We might never actually see something like that again, since the field of mathematics has matured so much, but there are still plenty of examples of questions that are 100+ years old that we still can't answer.
 
  • #9
I can't imagine the continuum hypothesis which stated that we couldn't know whether there's a subset of R could have the cardinality exact bigger than N and excatly smaller than R. maybe I would recommend the set theory. it's really weird.
 
  • #10
Any problem that is unsolved is unsolved for a reason. It is hard to say it is difficult or easy because it is unsolved! There are some theorems that don't seem too bad, but are actually incredibly hard to prove and others that seemed awful, but ended up having relatively simple proofs. There's no way to really tell. Perhaps the most famous unsolved problem is the Collatz Conjecture because it is so easily stated and yet has eluded all of humanity perhaps since shortly after humans first learned to count.
 

FAQ: What is the most perplexing and difficult unsolved math problem?

What is the most famous unsolved math problem?

The most famous unsolved math problem is the Millennium Prize Problems, a set of seven mathematical problems that were identified by the Clay Mathematics Institute in 2000 as the most difficult and important unsolved problems in mathematics. One of these problems is the P versus NP problem, which asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.

Why is the P versus NP problem considered the most perplexing and difficult unsolved math problem?

The P versus NP problem is considered the most perplexing and difficult unsolved math problem because it has far-reaching implications in fields such as cryptography, optimization, and artificial intelligence. Its solution would have a profound impact on our understanding of computation and could potentially revolutionize many industries and technologies.

How long has the P versus NP problem been unsolved?

The P versus NP problem has been unsolved since it was first proposed in 1971 by mathematician Stephen Cook and was later extended by Leonid Levin in 1973. Despite decades of research and numerous attempts to solve it, the problem remains one of the most challenging and elusive problems in mathematics.

Has there been any progress made towards solving the P versus NP problem?

There have been several breakthroughs and progress made towards solving the P versus NP problem, but a definitive solution has yet to be found. In 2010, mathematician Vinay Deolalikar claimed to have solved the problem, but his proof was later found to be flawed. Many mathematicians continue to work on this problem, and new techniques and approaches are constantly being developed.

What impact would solving the P versus NP problem have on the field of mathematics?

Solving the P versus NP problem would have a significant impact on the field of mathematics as it would provide a deeper understanding of the fundamental principles of computation. It would also lead to the development of new algorithms and techniques, and could potentially open the door to solving other difficult problems in mathematics and computer science.

Similar threads

Back
Top