| ▲ | free_bip a day ago |
| The reason this was "easy" is because the conjecture turned out to be false. If the collatz conjecture holds true (and most mathematicians seem to think it will), it will be much harder to prove than your average Erdos problem. |
|
| ▲ | beering a day ago | parent | next [-] |
| I think parent’s point is that every false conjecture can cost a lot of time to be spent on futile affirmative proofs. So if we “clean up” a bunch of false conjectures, then more effort can be spent on interesting proofs of the others. (Probably a rather naive view of the value of conjectures but I’m just offering an alternative interpretation of the comment.) |
| |
| ▲ | nommynommynom a day ago | parent | next [-] | | The opposing argument there is that the hope is that solving these problems reveals other interesting maths knowledge along the way. Finding a counter example all but ensures that won't ever happen. | | |
| ▲ | c32c33429009ed6 a day ago | parent | next [-] | | No, it opens up a whole new suite of questions. Now we can ask, for example: what conditions do we need for the result to hold? What dimensions does it hold in? And many more... | |
| ▲ | pegasus a day ago | parent | prev [-] | | I guess the question of why counterexamples are so rare and/or hard to find is still left to be investigated. |
| |
| ▲ | aureate 14 hours ago | parent | prev | next [-] | | The Collatz conjecture is a question about positive integers, so enumerating and checking all the possible counterexamples is trivial, albeit requiring infinite time. It has been verified up to 2.36×10^21. It could turn out to be false, but nobody's going to find a counterexample as surprisingly simple as the one Claude found for the Jacobian conjecture, which would be like finding a Collatz counterexample in the first few billion integers or so. ... Or would it? The Jacobian counterexample seems like an especially simple, near-trivial integer-coefficient polynomial, but I haven't seen any thorough analysis of how "hard" it would have been to find by brute force, and I haven't seen Claude's reasoning. | |
| ▲ | jibal a day ago | parent | prev [-] | | Did you read what you responded to? The Collatz conjecture is almost certainly not false, so no "clean up" is possible. | | |
| ▲ | aleph_minus_one a day ago | parent [-] | | > The Collatz conjecture is almost certainly not false, so no "clean up" is possible. Many people believed the same about the Jacobian Conjecture. | | |
|
|
|
| ▲ | llelouch a day ago | parent | prev | next [-] |
| True but Noam brown (openai researcher) said that in 2 years AI will start creating new math. |
| |
|
| ▲ | aizk a day ago | parent | prev [-] |
| Give the llms a few years, they'll be smart enough to make progress on that. |
