Authors: Talon J. Ward
The Collatz conjecture is a famous problem in number theory. Given an integer, if it's odd, multiply it by three and add one, or, if it's even, divide it by two. The Collatz conjecture states that any trajectory of iterates of this Collatz transformation on the positive integers will reach one in a finite number of steps. This problem explores the behavior of a complicated discrete dynamical system that has eluded solution for over seventy years.
This paper addresses the Collatz conjecture by altering the Collatz transformation into a friendlier format, which tells us what to do with an odd integer given its congruence modulo eight. We then describe how to find the numbers whose first few iterates follow a given pattern, which leads us to a directed graph that every trajectory must eventually enter. This directed graph then shows us that, in a finite number of steps, every iterate of a trajectory must either converge to one or strictly increase thereafter. Since there is no number whose trajectory strictly increases, the Collatz conjecture holds.
Comments: 8 Pages.
Download: PDF
[v1] 2012-09-26 14:28:15
[v2] 2012-09-28 08:32:46
[v4] 2013-02-21 20:19:07
[v5] 2013-02-24 21:31:35
Unique-IP document downloads: 533 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.