I'm only part way through looking at the proof in detail, but if this is the only flaw, does the proof show that while there may be other cycles besides 4-2-1, every number eventuallly cycles, rather than going off to infinity? If so, that's still a huge and exciting piece of progress on the problem! Andy On Mon, Oct 15, 2018 at 9:59 AM Adam P. Goucher <apgoucher@gmx.com> wrote:
Dear Joerg,
I think Claim C8 is unproved: I do not see why a tree cannot attach to itself (and thereby form a cycle).
Everything up to that point, as far as I can tell, is valid.
Best wishes,
Adam P. Goucher
Sent: Monday, October 15, 2018 at 2:23 PM From: "Joerg Arndt" <arndt@jjj.de> To: math-fun <math-fun@mailman.xmission.com> Subject: [math-fun] A (non-)proof of the Collatz 3n+1 problem.
Dear funsters, Georg Fischer has an attempt of a proof for the Collatz 3n+1 problem online here: http://www.teherba.org/index.php/OEIS/3x%2B1_Problem He suspects that it contains a flaw, hence refrains from contacting any big-wigs. With his permission I'd like to ask on this list what the problem may be. Any takers?
Georg will certainly add the reason for the invalidity of his proof as soon as someone points it out.
Best regards, jj
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Andy.Latto@pobox.com