2 ms·
The four-color theorem had the preliminary challenge of creating a method to identify all the relevant cases. That also required a mathematical theory. (I don't
by schoen 5y ago
The four-color theorem had the preliminary challenge of creating a method to identify all the relevant cases. That also required a mathematical theory. (I don't actually understand how it was done!)
If you didn't have that, you would have an infinite search for possible maps that violate the conjecture, because you wouldn't be able to divide them into a finite number of equivalence classes, or enumerate a finite number of possible counterexamples, or whatever.
For Collatz, I don't think we have any lemma that gives a path to saying "a counterexample must be one of these 2¹⁰⁰ integers" or the like. So without such a thing, checking every possibility would mean checking every integer. (Well, there are definitely lemmas that make it unnecessary to check large numbers of integers, so I should say instead that checking every possibility would still mean checking an infinite number of cases.)
- kevinventullo 5y agoAs an interesting example where we did have a finite bound that was still out of reach to computationally exhaust, see the Weak Goldbach Conjecture: https://en.m.wikipedia.org/wiki/Goldbach%27s_weak_conjecture https://en.m.wikipedia.org/wiki/Goldbach%27s_weak_conjecture It was known to have at most finitely many counter-examples by the 1930’s, and by the 1950’s it was known that the largest counter-example had to be < 3^3^15. In 2002 that was lowered to about 10^1346. Still well out of reach of any computer! Only in 2012 was an unconditional proof given.