Hacker News new | past | comments | ask | show | jobs | submit login
Collatz 3n + 1 conjecture possibly solved (johndcook.com)
56 points by wslh on June 3, 2011 | hide | past | favorite | 20 comments



Misleading title and post virtually devoid of content. Link to the actual paper: http://preprint.math.uni-hamburg.de/public/papers/hbam/hbam2...


Title changed. Thanks.


The paper has not been peer reviewed yet. Therefore the conjecture has not yet been solved.

Have we forgot the recent NP≠P paper? The author was also a highly-regarded scientist. That did not guarantee anything.


Was the title edited? It now says possibly solved, which certainly admits that the proof hasn't been reviewed, much less acclaimed.


Speaking of which, was that NP≠P paper debunked? What came of that?


It was debunked by some of the top minds in the world (e.g. Terry Tao), though the author's webpage states that it's under journal review.

Here's the "official" debunking summary on PolyMath:

http://michaelnielsen.org/polymath1/index.php?title=Deolalik...

If you want to read some of the discussions, a good place to start is RJ Lipton's blog and the comments there:

http://rjlipton.wordpress.com/2010/08/12/fatal-flaws-in-deol...

There were also a few HN posts, e.g.:

http://news.ycombinator.com/item?id=1600068


If I remember correctly it was a work in progress paper and he never really finished it and he didn't intend for it to go public.

But someone else should probably correct/confirm me.


I would wait for this to be peer-reviewed before getting excited. Especially since Paul Erdős said about the Collatz conjecture: "Mathematics is not yet ready for such problems." ( http://en.wikipedia.org/wiki/Collatz_conjecture )


Roy Adler made that same, which reminds me, I wonder if Erdos offered money for this one?


Erdös also said: "Mathematics is not yet ready for such problems."


Wikipedia says $500.


Any mathematicians here wish to take a look at the paper, and comment on the likelihood the proof is solid?


I will look at it this weekend. If true, the productivity of math departments everywhere will go up. I know so many that banged their heads on this one for a while. I once wasted an entire week playing with this on the Symbolics. It's horribly addicting because of it's simplicity.


How do you measure the productivity of a math department?


One; minus the time spent either dividing even numbers by two or multiplying odd numbers by three and adding one, over the total time working.


The same way you measure productivity of a programmer. LoP (Lines of Proof) per day.


Fwiw, the author of the paper did his PhD work with Collatz himself, though that was over 40 years ago (http://genealogy.math.ndsu.nodak.edu/id.php?id=27958). Not conclusive, but makes me inclined to consider it a serious effort. Not qualified to judge beyond that, though.


I wouldn't take that as changing the odds of correctness. Collatz stated the conjecture but made no progress towards a solution.


I can't say, I looked at this briefly and was hoping for an elementary proof. This paper casts the problem in terms of linear operators over holomorphic function spaces and assumes a number of prior results in that area, and it's been far too long since I read complex analysis.

In some sense it's a little unsatisfying that a simple proof has not been found, but this is what makes math so addicting I suppose.


I'm not really a mathematician yet, but I skimmed the paper and the approach seemed reasonable when taken at face value.

Then again, I said the same thing when Penny Smith published her paper on NSE.




Consider applying for YC's W25 batch! Applications are open till Nov 12.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: