Were the world’s most “difficult” math problems constructed to be unsolvable?
In: Mathematics
I donʼt think so. Especially how many of them intuitively _seem_ easy. Fermatʼs Last Theorem is like finding pythagorean triplets (we know a lot since ancient times) for powers greater than two. (this one got solved after 3 and a half centuries)
Collatz Conjecture is basic arithmetics. One can imagine playing with numbers like this to kill time.
P/NP problem stems from very practical questions of computer science. It seems like obviously if P equaled NP then someone should have found an algorithm that solves some NP problem in P. Nobody did, but proving that it is impossible is very tricky.
Compare this with problems that are designed to be hard and convoluted. Like the three aliens that use two words https://youtu.be/LKvjIsyYng8?si=iVydk3i0AewpdTQ2
Latest Answers