Open Problem Garden - The 3n+1 conjecture - Comments

Peter Schorer, again a possible proof (re: The 3n+1 conjecture)

Anonymous — Fri, 11 Jul 2014 04:00:31 +0200

Just last month, July 2014, Schorer published another paper which uses similar methods as from his 2008 paper, claiming again to have proven the conjecture. This is early, but I am wanting to know what the general opinion of Schorer is in the world of serious mathematicians. All of my research has turned up mixed reviews and heated arguments.

In The 3x+1 Problem: An (re: The 3n+1 conjecture)

brenton — Wed, 11 Jun 2008 18:45:22 +0200

In The 3x+1 Problem: An Annotated Bibliography, II (2001-), Lagarias explains why this proof is incomplete.

Bruckman proved 3x+1 problem (re: The 3n+1 conjecture)

porton — Wed, 09 Apr 2008 14:54:48 +0200

From PlanetMath's forums:

> Bruckman has published his proof of the conjecture in the International Journal of Mathematical Education in Science and Technology,
> Vol 39, Issue 3 April 2008.

--
Victor Porton - http://www.mathematics21.org

Somebody's efforts (re: The 3n+1 conjecture)

porton — Mon, 14 Jan 2008 12:57:11 +0100

At http://occampress.com/ somebody publishes something about 3n+1 problem. Read him and check whether he is true.

Victor Porton - http://www.mathematics21.org

The 3n+1 conjecture

dododododo — Fri, 13 Jul 2007 01:35:46 +0200

Author(s): Collatz

Subject: Number Theory » Combinatorial N.T.

Conjecture Let if is odd and if is even. Let . Assume we start with some number and repeatedly take the of the current number. Prove that no matter what the initial number is we eventually reach .